./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129b0578c0c64625cef50fbcfd5d128651ff3275 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:45:57,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:45:57,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:45:57,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:45:57,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:45:57,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:45:57,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:45:57,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:45:57,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:45:57,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:45:57,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:45:57,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:45:57,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:45:57,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:45:57,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:45:57,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:45:57,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:45:57,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:45:57,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:45:57,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:45:57,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:45:57,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:45:57,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:45:57,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:45:57,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:45:57,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:45:57,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:45:57,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:45:57,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:45:57,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:45:57,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:45:57,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:45:57,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:45:57,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:45:57,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:45:57,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:45:57,719 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 03:45:57,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:45:57,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:45:57,731 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:45:57,731 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:45:57,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:45:57,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:45:57,732 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:45:57,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:45:57,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:45:57,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:45:57,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:45:57,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:45:57,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:45:57,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:45:57,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:45:57,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:45:57,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:45:57,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:45:57,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:45:57,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:45:57,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:45:57,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:45:57,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:45:57,736 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_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-10 03:45:57,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:45:57,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:45:57,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:45:57,776 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:45:57,776 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:45:57,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 03:45:57,824 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/data/fe3507d6b/16389c7f681e4ba18a94588dc9a29cb9/FLAG8bc2d82c8 [2018-11-10 03:45:58,160 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:45:58,161 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 03:45:58,168 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/data/fe3507d6b/16389c7f681e4ba18a94588dc9a29cb9/FLAG8bc2d82c8 [2018-11-10 03:45:58,179 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/data/fe3507d6b/16389c7f681e4ba18a94588dc9a29cb9 [2018-11-10 03:45:58,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:45:58,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:45:58,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:45:58,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:45:58,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:45:58,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58, skipping insertion in model container [2018-11-10 03:45:58,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:45:58,215 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:45:58,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:45:58,345 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:45:58,366 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:45:58,375 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:45:58,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58 WrapperNode [2018-11-10 03:45:58,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:45:58,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:45:58,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:45:58,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:45:58,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... [2018-11-10 03:45:58,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:45:58,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:45:58,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:45:58,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:45:58,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/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-10 03:45:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:45:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:45:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:45:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:45:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 03:45:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:45:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:45:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:45:58,763 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:45:58,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:45:58 BoogieIcfgContainer [2018-11-10 03:45:58,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:45:58,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:45:58,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:45:58,768 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:45:58,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:45:58" (1/3) ... [2018-11-10 03:45:58,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afea132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:45:58, skipping insertion in model container [2018-11-10 03:45:58,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:45:58" (2/3) ... [2018-11-10 03:45:58,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afea132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:45:58, skipping insertion in model container [2018-11-10 03:45:58,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:45:58" (3/3) ... [2018-11-10 03:45:58,771 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 03:45:58,780 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:45:58,787 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:45:58,802 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:45:58,829 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:45:58,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:45:58,829 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:45:58,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:45:58,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:45:58,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:45:58,830 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:45:58,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:45:58,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:45:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-10 03:45:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:45:58,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:58,852 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-10 03:45:58,853 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:58,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash -26794943, now seen corresponding path program 1 times [2018-11-10 03:45:58,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:58,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:58,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,022 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-10 03:45:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,040 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-10 03:45:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,091 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2018-11-10 03:45:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 03:45:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,101 INFO L225 Difference]: With dead ends: 119 [2018-11-10 03:45:59,101 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 03:45:59,104 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-10 03:45:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 03:45:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-10 03:45:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 03:45:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2018-11-10 03:45:59,135 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2018-11-10 03:45:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,135 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2018-11-10 03:45:59,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2018-11-10 03:45:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 03:45:59,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,136 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-10 03:45:59,136 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939649, now seen corresponding path program 1 times [2018-11-10 03:45:59,136 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,201 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-10 03:45:59,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,203 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand 3 states. [2018-11-10 03:45:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,224 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2018-11-10 03:45:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 03:45:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,225 INFO L225 Difference]: With dead ends: 170 [2018-11-10 03:45:59,225 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 03:45:59,226 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-10 03:45:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 03:45:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-10 03:45:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 03:45:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 187 transitions. [2018-11-10 03:45:59,232 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 187 transitions. Word has length 26 [2018-11-10 03:45:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,233 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 187 transitions. [2018-11-10 03:45:59,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2018-11-10 03:45:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 03:45:59,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,233 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-10 03:45:59,234 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -830431472, now seen corresponding path program 1 times [2018-11-10 03:45:59,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,275 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-10 03:45:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,276 INFO L87 Difference]: Start difference. First operand 102 states and 187 transitions. Second operand 3 states. [2018-11-10 03:45:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,294 INFO L93 Difference]: Finished difference Result 157 states and 283 transitions. [2018-11-10 03:45:59,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 03:45:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,296 INFO L225 Difference]: With dead ends: 157 [2018-11-10 03:45:59,296 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 03:45:59,296 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-10 03:45:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 03:45:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-10 03:45:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 03:45:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 190 transitions. [2018-11-10 03:45:59,305 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 190 transitions. Word has length 27 [2018-11-10 03:45:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,305 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 190 transitions. [2018-11-10 03:45:59,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 190 transitions. [2018-11-10 03:45:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 03:45:59,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,306 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-10 03:45:59,307 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1775592082, now seen corresponding path program 1 times [2018-11-10 03:45:59,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,344 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-10 03:45:59,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,346 INFO L87 Difference]: Start difference. First operand 106 states and 190 transitions. Second operand 3 states. [2018-11-10 03:45:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,370 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2018-11-10 03:45:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 03:45:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,372 INFO L225 Difference]: With dead ends: 201 [2018-11-10 03:45:59,372 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 03:45:59,372 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-10 03:45:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 03:45:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 139. [2018-11-10 03:45:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 03:45:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 251 transitions. [2018-11-10 03:45:59,380 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 251 transitions. Word has length 27 [2018-11-10 03:45:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,380 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 251 transitions. [2018-11-10 03:45:59,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 251 transitions. [2018-11-10 03:45:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 03:45:59,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,381 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-10 03:45:59,381 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -218552624, now seen corresponding path program 1 times [2018-11-10 03:45:59,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,416 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-10 03:45:59,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,417 INFO L87 Difference]: Start difference. First operand 139 states and 251 transitions. Second operand 3 states. [2018-11-10 03:45:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,436 INFO L93 Difference]: Finished difference Result 331 states and 605 transitions. [2018-11-10 03:45:59,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 03:45:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,438 INFO L225 Difference]: With dead ends: 331 [2018-11-10 03:45:59,438 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 03:45:59,439 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-10 03:45:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 03:45:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-10 03:45:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-10 03:45:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 359 transitions. [2018-11-10 03:45:59,448 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 359 transitions. Word has length 27 [2018-11-10 03:45:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,448 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 359 transitions. [2018-11-10 03:45:59,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-10 03:45:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 03:45:59,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,449 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-10 03:45:59,450 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -791008204, now seen corresponding path program 1 times [2018-11-10 03:45:59,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,480 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-10 03:45:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,481 INFO L87 Difference]: Start difference. First operand 199 states and 359 transitions. Second operand 3 states. [2018-11-10 03:45:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,496 INFO L93 Difference]: Finished difference Result 298 states and 536 transitions. [2018-11-10 03:45:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 03:45:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,497 INFO L225 Difference]: With dead ends: 298 [2018-11-10 03:45:59,497 INFO L226 Difference]: Without dead ends: 203 [2018-11-10 03:45:59,498 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-10 03:45:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-10 03:45:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-10 03:45:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 03:45:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 359 transitions. [2018-11-10 03:45:59,508 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 359 transitions. Word has length 28 [2018-11-10 03:45:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,509 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 359 transitions. [2018-11-10 03:45:59,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 359 transitions. [2018-11-10 03:45:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 03:45:59,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,510 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-10 03:45:59,510 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1815015350, now seen corresponding path program 1 times [2018-11-10 03:45:59,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,540 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-10 03:45:59,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,541 INFO L87 Difference]: Start difference. First operand 201 states and 359 transitions. Second operand 3 states. [2018-11-10 03:45:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,558 INFO L93 Difference]: Finished difference Result 381 states and 689 transitions. [2018-11-10 03:45:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 03:45:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,560 INFO L225 Difference]: With dead ends: 381 [2018-11-10 03:45:59,560 INFO L226 Difference]: Without dead ends: 379 [2018-11-10 03:45:59,561 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-10 03:45:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-10 03:45:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 269. [2018-11-10 03:45:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-10 03:45:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 479 transitions. [2018-11-10 03:45:59,575 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 479 transitions. Word has length 28 [2018-11-10 03:45:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,576 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 479 transitions. [2018-11-10 03:45:59,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 479 transitions. [2018-11-10 03:45:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 03:45:59,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,577 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-10 03:45:59,577 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -179129356, now seen corresponding path program 1 times [2018-11-10 03:45:59,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,611 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-10 03:45:59,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,612 INFO L87 Difference]: Start difference. First operand 269 states and 479 transitions. Second operand 3 states. [2018-11-10 03:45:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,635 INFO L93 Difference]: Finished difference Result 645 states and 1157 transitions. [2018-11-10 03:45:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 03:45:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,637 INFO L225 Difference]: With dead ends: 645 [2018-11-10 03:45:59,637 INFO L226 Difference]: Without dead ends: 387 [2018-11-10 03:45:59,638 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-10 03:45:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-10 03:45:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-11-10 03:45:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-10 03:45:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 683 transitions. [2018-11-10 03:45:59,650 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 683 transitions. Word has length 28 [2018-11-10 03:45:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,650 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 683 transitions. [2018-11-10 03:45:59,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 683 transitions. [2018-11-10 03:45:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 03:45:59,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,652 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-10 03:45:59,652 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash 431113445, now seen corresponding path program 1 times [2018-11-10 03:45:59,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,675 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-10 03:45:59,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,677 INFO L87 Difference]: Start difference. First operand 385 states and 683 transitions. Second operand 3 states. [2018-11-10 03:45:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,699 INFO L93 Difference]: Finished difference Result 577 states and 1021 transitions. [2018-11-10 03:45:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 03:45:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,702 INFO L225 Difference]: With dead ends: 577 [2018-11-10 03:45:59,702 INFO L226 Difference]: Without dead ends: 391 [2018-11-10 03:45:59,703 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-10 03:45:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-10 03:45:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-11-10 03:45:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-10 03:45:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 683 transitions. [2018-11-10 03:45:59,715 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 683 transitions. Word has length 29 [2018-11-10 03:45:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,716 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 683 transitions. [2018-11-10 03:45:59,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 683 transitions. [2018-11-10 03:45:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 03:45:59,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,717 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-10 03:45:59,717 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1257830297, now seen corresponding path program 1 times [2018-11-10 03:45:59,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,751 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-10 03:45:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,753 INFO L87 Difference]: Start difference. First operand 389 states and 683 transitions. Second operand 3 states. [2018-11-10 03:45:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,779 INFO L93 Difference]: Finished difference Result 733 states and 1305 transitions. [2018-11-10 03:45:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 03:45:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,782 INFO L225 Difference]: With dead ends: 733 [2018-11-10 03:45:59,782 INFO L226 Difference]: Without dead ends: 731 [2018-11-10 03:45:59,783 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-10 03:45:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-10 03:45:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 529. [2018-11-10 03:45:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-10 03:45:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 919 transitions. [2018-11-10 03:45:59,801 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 919 transitions. Word has length 29 [2018-11-10 03:45:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,802 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 919 transitions. [2018-11-10 03:45:59,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 919 transitions. [2018-11-10 03:45:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 03:45:59,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,803 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-10 03:45:59,803 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1042992293, now seen corresponding path program 1 times [2018-11-10 03:45:59,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,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-10 03:45:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,825 INFO L87 Difference]: Start difference. First operand 529 states and 919 transitions. Second operand 3 states. [2018-11-10 03:45:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,855 INFO L93 Difference]: Finished difference Result 1269 states and 2217 transitions. [2018-11-10 03:45:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 03:45:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,858 INFO L225 Difference]: With dead ends: 1269 [2018-11-10 03:45:59,858 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 03:45:59,859 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-10 03:45:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 03:45:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-10 03:45:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-10 03:45:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1303 transitions. [2018-11-10 03:45:59,880 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1303 transitions. Word has length 29 [2018-11-10 03:45:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,880 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 1303 transitions. [2018-11-10 03:45:59,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1303 transitions. [2018-11-10 03:45:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 03:45:59,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,882 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-10 03:45:59,882 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -337820759, now seen corresponding path program 1 times [2018-11-10 03:45:59,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,912 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-10 03:45:59,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,913 INFO L87 Difference]: Start difference. First operand 753 states and 1303 transitions. Second operand 3 states. [2018-11-10 03:45:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:45:59,935 INFO L93 Difference]: Finished difference Result 1129 states and 1949 transitions. [2018-11-10 03:45:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:45:59,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 03:45:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:45:59,938 INFO L225 Difference]: With dead ends: 1129 [2018-11-10 03:45:59,938 INFO L226 Difference]: Without dead ends: 763 [2018-11-10 03:45:59,939 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-10 03:45:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-10 03:45:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2018-11-10 03:45:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-10 03:45:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1303 transitions. [2018-11-10 03:45:59,959 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1303 transitions. Word has length 30 [2018-11-10 03:45:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:45:59,959 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1303 transitions. [2018-11-10 03:45:59,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:45:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1303 transitions. [2018-11-10 03:45:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 03:45:59,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:45:59,961 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-10 03:45:59,961 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:45:59,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:45:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764501, now seen corresponding path program 1 times [2018-11-10 03:45:59,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:45:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:45:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:45:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:45:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:45:59,979 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-10 03:45:59,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:45:59,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:45:59,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:45:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:45:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:45:59,980 INFO L87 Difference]: Start difference. First operand 761 states and 1303 transitions. Second operand 3 states. [2018-11-10 03:46:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,016 INFO L93 Difference]: Finished difference Result 2221 states and 3801 transitions. [2018-11-10 03:46:00,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 03:46:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,021 INFO L225 Difference]: With dead ends: 2221 [2018-11-10 03:46:00,021 INFO L226 Difference]: Without dead ends: 1483 [2018-11-10 03:46:00,023 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-10 03:46:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-10 03:46:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2018-11-10 03:46:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-10 03:46:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2503 transitions. [2018-11-10 03:46:00,065 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2503 transitions. Word has length 30 [2018-11-10 03:46:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,066 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 2503 transitions. [2018-11-10 03:46:00,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2503 transitions. [2018-11-10 03:46:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 03:46:00,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,068 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-10 03:46:00,068 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -32619795, now seen corresponding path program 1 times [2018-11-10 03:46:00,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,093 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-10 03:46:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,094 INFO L87 Difference]: Start difference. First operand 1481 states and 2503 transitions. Second operand 3 states. [2018-11-10 03:46:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,126 INFO L93 Difference]: Finished difference Result 1853 states and 3193 transitions. [2018-11-10 03:46:00,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 03:46:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,134 INFO L225 Difference]: With dead ends: 1853 [2018-11-10 03:46:00,134 INFO L226 Difference]: Without dead ends: 1851 [2018-11-10 03:46:00,135 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-10 03:46:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-11-10 03:46:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1481. [2018-11-10 03:46:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-10 03:46:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2487 transitions. [2018-11-10 03:46:00,181 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2487 transitions. Word has length 30 [2018-11-10 03:46:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,183 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 2487 transitions. [2018-11-10 03:46:00,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2487 transitions. [2018-11-10 03:46:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 03:46:00,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,185 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-10 03:46:00,185 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1595023034, now seen corresponding path program 1 times [2018-11-10 03:46:00,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,203 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-10 03:46:00,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,204 INFO L87 Difference]: Start difference. First operand 1481 states and 2487 transitions. Second operand 3 states. [2018-11-10 03:46:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,247 INFO L93 Difference]: Finished difference Result 2749 states and 4697 transitions. [2018-11-10 03:46:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 03:46:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,256 INFO L225 Difference]: With dead ends: 2749 [2018-11-10 03:46:00,257 INFO L226 Difference]: Without dead ends: 2747 [2018-11-10 03:46:00,258 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-10 03:46:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-10 03:46:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2073. [2018-11-10 03:46:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-10 03:46:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3415 transitions. [2018-11-10 03:46:00,311 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3415 transitions. Word has length 31 [2018-11-10 03:46:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,311 INFO L481 AbstractCegarLoop]: Abstraction has 2073 states and 3415 transitions. [2018-11-10 03:46:00,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3415 transitions. [2018-11-10 03:46:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 03:46:00,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,314 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-10 03:46:00,314 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash -399121672, now seen corresponding path program 1 times [2018-11-10 03:46:00,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,344 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-10 03:46:00,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,346 INFO L87 Difference]: Start difference. First operand 2073 states and 3415 transitions. Second operand 3 states. [2018-11-10 03:46:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,400 INFO L93 Difference]: Finished difference Result 4957 states and 8217 transitions. [2018-11-10 03:46:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 03:46:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,409 INFO L225 Difference]: With dead ends: 4957 [2018-11-10 03:46:00,409 INFO L226 Difference]: Without dead ends: 2907 [2018-11-10 03:46:00,412 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-10 03:46:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-10 03:46:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2905. [2018-11-10 03:46:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2018-11-10 03:46:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4775 transitions. [2018-11-10 03:46:00,499 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4775 transitions. Word has length 31 [2018-11-10 03:46:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,500 INFO L481 AbstractCegarLoop]: Abstraction has 2905 states and 4775 transitions. [2018-11-10 03:46:00,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4775 transitions. [2018-11-10 03:46:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 03:46:00,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,503 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-10 03:46:00,503 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2093680032, now seen corresponding path program 1 times [2018-11-10 03:46:00,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,522 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-10 03:46:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,523 INFO L87 Difference]: Start difference. First operand 2905 states and 4775 transitions. Second operand 3 states. [2018-11-10 03:46:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,608 INFO L93 Difference]: Finished difference Result 4381 states and 7193 transitions. [2018-11-10 03:46:00,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 03:46:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,617 INFO L225 Difference]: With dead ends: 4381 [2018-11-10 03:46:00,617 INFO L226 Difference]: Without dead ends: 2955 [2018-11-10 03:46:00,620 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-10 03:46:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-10 03:46:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2018-11-10 03:46:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-10 03:46:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4807 transitions. [2018-11-10 03:46:00,686 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4807 transitions. Word has length 32 [2018-11-10 03:46:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,686 INFO L481 AbstractCegarLoop]: Abstraction has 2953 states and 4807 transitions. [2018-11-10 03:46:00,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4807 transitions. [2018-11-10 03:46:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 03:46:00,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,689 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-10 03:46:00,690 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash 512343522, now seen corresponding path program 1 times [2018-11-10 03:46:00,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,717 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-10 03:46:00,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,718 INFO L87 Difference]: Start difference. First operand 2953 states and 4807 transitions. Second operand 3 states. [2018-11-10 03:46:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:00,787 INFO L93 Difference]: Finished difference Result 5389 states and 8937 transitions. [2018-11-10 03:46:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:00,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 03:46:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:00,803 INFO L225 Difference]: With dead ends: 5389 [2018-11-10 03:46:00,803 INFO L226 Difference]: Without dead ends: 5387 [2018-11-10 03:46:00,805 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-10 03:46:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-10 03:46:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 4169. [2018-11-10 03:46:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2018-11-10 03:46:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6631 transitions. [2018-11-10 03:46:00,898 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6631 transitions. Word has length 32 [2018-11-10 03:46:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:00,898 INFO L481 AbstractCegarLoop]: Abstraction has 4169 states and 6631 transitions. [2018-11-10 03:46:00,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6631 transitions. [2018-11-10 03:46:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 03:46:00,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:00,903 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-10 03:46:00,903 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1481801184, now seen corresponding path program 1 times [2018-11-10 03:46:00,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:00,929 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-10 03:46:00,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:00,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:00,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:00,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:00,930 INFO L87 Difference]: Start difference. First operand 4169 states and 6631 transitions. Second operand 3 states. [2018-11-10 03:46:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:01,008 INFO L93 Difference]: Finished difference Result 9869 states and 15785 transitions. [2018-11-10 03:46:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:01,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 03:46:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:01,025 INFO L225 Difference]: With dead ends: 9869 [2018-11-10 03:46:01,025 INFO L226 Difference]: Without dead ends: 5771 [2018-11-10 03:46:01,031 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-10 03:46:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2018-11-10 03:46:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2018-11-10 03:46:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-10 03:46:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 9159 transitions. [2018-11-10 03:46:01,160 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 9159 transitions. Word has length 32 [2018-11-10 03:46:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:01,160 INFO L481 AbstractCegarLoop]: Abstraction has 5769 states and 9159 transitions. [2018-11-10 03:46:01,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 9159 transitions. [2018-11-10 03:46:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 03:46:01,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:01,165 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-10 03:46:01,165 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1297006195, now seen corresponding path program 1 times [2018-11-10 03:46:01,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:01,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:01,195 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-10 03:46:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:01,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:01,196 INFO L87 Difference]: Start difference. First operand 5769 states and 9159 transitions. Second operand 3 states. [2018-11-10 03:46:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:01,265 INFO L93 Difference]: Finished difference Result 8653 states and 13705 transitions. [2018-11-10 03:46:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:01,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 03:46:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:01,276 INFO L225 Difference]: With dead ends: 8653 [2018-11-10 03:46:01,276 INFO L226 Difference]: Without dead ends: 5835 [2018-11-10 03:46:01,281 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-10 03:46:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-11-10 03:46:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5833. [2018-11-10 03:46:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2018-11-10 03:46:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 9159 transitions. [2018-11-10 03:46:01,395 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 9159 transitions. Word has length 33 [2018-11-10 03:46:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:01,395 INFO L481 AbstractCegarLoop]: Abstraction has 5833 states and 9159 transitions. [2018-11-10 03:46:01,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 9159 transitions. [2018-11-10 03:46:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 03:46:01,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:01,400 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-10 03:46:01,400 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:01,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1309017359, now seen corresponding path program 1 times [2018-11-10 03:46:01,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:01,416 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-10 03:46:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:01,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:01,417 INFO L87 Difference]: Start difference. First operand 5833 states and 9159 transitions. Second operand 3 states. [2018-11-10 03:46:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:01,543 INFO L93 Difference]: Finished difference Result 10509 states and 16841 transitions. [2018-11-10 03:46:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:01,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 03:46:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:01,562 INFO L225 Difference]: With dead ends: 10509 [2018-11-10 03:46:01,563 INFO L226 Difference]: Without dead ends: 10507 [2018-11-10 03:46:01,566 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-10 03:46:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-11-10 03:46:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8329. [2018-11-10 03:46:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-10 03:46:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 12743 transitions. [2018-11-10 03:46:01,746 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 12743 transitions. Word has length 33 [2018-11-10 03:46:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:01,747 INFO L481 AbstractCegarLoop]: Abstraction has 8329 states and 12743 transitions. [2018-11-10 03:46:01,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 12743 transitions. [2018-11-10 03:46:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 03:46:01,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:01,779 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-10 03:46:01,780 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:01,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash -685127347, now seen corresponding path program 1 times [2018-11-10 03:46:01,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:01,794 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-10 03:46:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:01,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:01,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:01,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:01,795 INFO L87 Difference]: Start difference. First operand 8329 states and 12743 transitions. Second operand 3 states. [2018-11-10 03:46:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:01,929 INFO L93 Difference]: Finished difference Result 19597 states and 30153 transitions. [2018-11-10 03:46:01,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:01,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 03:46:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:01,949 INFO L225 Difference]: With dead ends: 19597 [2018-11-10 03:46:01,949 INFO L226 Difference]: Without dead ends: 11403 [2018-11-10 03:46:01,960 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-10 03:46:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11403 states. [2018-11-10 03:46:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11403 to 11401. [2018-11-10 03:46:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-11-10 03:46:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17415 transitions. [2018-11-10 03:46:02,173 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17415 transitions. Word has length 33 [2018-11-10 03:46:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:02,174 INFO L481 AbstractCegarLoop]: Abstraction has 11401 states and 17415 transitions. [2018-11-10 03:46:02,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17415 transitions. [2018-11-10 03:46:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 03:46:02,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:02,183 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-10 03:46:02,184 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:02,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1925046613, now seen corresponding path program 1 times [2018-11-10 03:46:02,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:02,200 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-10 03:46:02,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:02,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:02,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:02,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:02,201 INFO L87 Difference]: Start difference. First operand 11401 states and 17415 transitions. Second operand 3 states. [2018-11-10 03:46:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:02,320 INFO L93 Difference]: Finished difference Result 17101 states and 26057 transitions. [2018-11-10 03:46:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:02,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 03:46:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:02,339 INFO L225 Difference]: With dead ends: 17101 [2018-11-10 03:46:02,339 INFO L226 Difference]: Without dead ends: 11531 [2018-11-10 03:46:02,349 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-10 03:46:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11531 states. [2018-11-10 03:46:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11531 to 11529. [2018-11-10 03:46:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-10 03:46:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17415 transitions. [2018-11-10 03:46:02,544 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17415 transitions. Word has length 34 [2018-11-10 03:46:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:02,544 INFO L481 AbstractCegarLoop]: Abstraction has 11529 states and 17415 transitions. [2018-11-10 03:46:02,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17415 transitions. [2018-11-10 03:46:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 03:46:02,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:02,551 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-10 03:46:02,551 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:02,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 236102871, now seen corresponding path program 1 times [2018-11-10 03:46:02,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:02,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:02,567 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-10 03:46:02,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:02,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:02,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:02,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:02,568 INFO L87 Difference]: Start difference. First operand 11529 states and 17415 transitions. Second operand 3 states. [2018-11-10 03:46:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:02,745 INFO L93 Difference]: Finished difference Result 20493 states and 31625 transitions. [2018-11-10 03:46:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:02,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 03:46:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:02,779 INFO L225 Difference]: With dead ends: 20493 [2018-11-10 03:46:02,779 INFO L226 Difference]: Without dead ends: 20491 [2018-11-10 03:46:02,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-10 03:46:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2018-11-10 03:46:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 16649. [2018-11-10 03:46:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-10 03:46:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 24455 transitions. [2018-11-10 03:46:03,058 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 24455 transitions. Word has length 34 [2018-11-10 03:46:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:03,059 INFO L481 AbstractCegarLoop]: Abstraction has 16649 states and 24455 transitions. [2018-11-10 03:46:03,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 24455 transitions. [2018-11-10 03:46:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 03:46:03,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:03,066 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-10 03:46:03,066 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:03,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1758041835, now seen corresponding path program 1 times [2018-11-10 03:46:03,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:03,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:03,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:03,087 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-10 03:46:03,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:03,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:03,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:03,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:03,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:03,088 INFO L87 Difference]: Start difference. First operand 16649 states and 24455 transitions. Second operand 3 states. [2018-11-10 03:46:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:03,262 INFO L93 Difference]: Finished difference Result 38925 states and 57481 transitions. [2018-11-10 03:46:03,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:03,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 03:46:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:03,279 INFO L225 Difference]: With dead ends: 38925 [2018-11-10 03:46:03,280 INFO L226 Difference]: Without dead ends: 22539 [2018-11-10 03:46:03,300 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-10 03:46:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22539 states. [2018-11-10 03:46:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22539 to 22537. [2018-11-10 03:46:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22537 states. [2018-11-10 03:46:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 33031 transitions. [2018-11-10 03:46:03,665 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 33031 transitions. Word has length 34 [2018-11-10 03:46:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:03,665 INFO L481 AbstractCegarLoop]: Abstraction has 22537 states and 33031 transitions. [2018-11-10 03:46:03,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 33031 transitions. [2018-11-10 03:46:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 03:46:03,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:03,673 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-10 03:46:03,673 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:03,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1270531102, now seen corresponding path program 1 times [2018-11-10 03:46:03,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:03,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:03,693 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-10 03:46:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:03,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:03,694 INFO L87 Difference]: Start difference. First operand 22537 states and 33031 transitions. Second operand 3 states. [2018-11-10 03:46:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:03,875 INFO L93 Difference]: Finished difference Result 33805 states and 49417 transitions. [2018-11-10 03:46:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:03,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 03:46:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:03,891 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 03:46:03,891 INFO L226 Difference]: Without dead ends: 22795 [2018-11-10 03:46:03,901 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-10 03:46:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22795 states. [2018-11-10 03:46:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22795 to 22793. [2018-11-10 03:46:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22793 states. [2018-11-10 03:46:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22793 states to 22793 states and 33031 transitions. [2018-11-10 03:46:04,167 INFO L78 Accepts]: Start accepts. Automaton has 22793 states and 33031 transitions. Word has length 35 [2018-11-10 03:46:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:04,167 INFO L481 AbstractCegarLoop]: Abstraction has 22793 states and 33031 transitions. [2018-11-10 03:46:04,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22793 states and 33031 transitions. [2018-11-10 03:46:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 03:46:04,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:04,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, 1] [2018-11-10 03:46:04,176 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1335492452, now seen corresponding path program 1 times [2018-11-10 03:46:04,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:04,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:04,192 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-10 03:46:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:04,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:04,193 INFO L87 Difference]: Start difference. First operand 22793 states and 33031 transitions. Second operand 3 states. [2018-11-10 03:46:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:04,474 INFO L93 Difference]: Finished difference Result 39949 states and 59145 transitions. [2018-11-10 03:46:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:04,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 03:46:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:04,510 INFO L225 Difference]: With dead ends: 39949 [2018-11-10 03:46:04,510 INFO L226 Difference]: Without dead ends: 39947 [2018-11-10 03:46:04,518 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-10 03:46:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39947 states. [2018-11-10 03:46:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39947 to 33289. [2018-11-10 03:46:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33289 states. [2018-11-10 03:46:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 46855 transitions. [2018-11-10 03:46:04,957 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 46855 transitions. Word has length 35 [2018-11-10 03:46:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:04,958 INFO L481 AbstractCegarLoop]: Abstraction has 33289 states and 46855 transitions. [2018-11-10 03:46:04,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 46855 transitions. [2018-11-10 03:46:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 03:46:04,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:04,972 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-10 03:46:04,972 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:04,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash -658652254, now seen corresponding path program 1 times [2018-11-10 03:46:04,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:05,011 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-10 03:46:05,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:05,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:05,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:05,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:05,012 INFO L87 Difference]: Start difference. First operand 33289 states and 46855 transitions. Second operand 3 states. [2018-11-10 03:46:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:05,372 INFO L93 Difference]: Finished difference Result 77325 states and 109321 transitions. [2018-11-10 03:46:05,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:05,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 03:46:05,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:05,405 INFO L225 Difference]: With dead ends: 77325 [2018-11-10 03:46:05,405 INFO L226 Difference]: Without dead ends: 44555 [2018-11-10 03:46:05,427 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-10 03:46:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44555 states. [2018-11-10 03:46:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44555 to 44553. [2018-11-10 03:46:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44553 states. [2018-11-10 03:46:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44553 states to 44553 states and 62471 transitions. [2018-11-10 03:46:06,326 INFO L78 Accepts]: Start accepts. Automaton has 44553 states and 62471 transitions. Word has length 35 [2018-11-10 03:46:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:06,326 INFO L481 AbstractCegarLoop]: Abstraction has 44553 states and 62471 transitions. [2018-11-10 03:46:06,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 44553 states and 62471 transitions. [2018-11-10 03:46:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 03:46:06,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:06,343 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-10 03:46:06,344 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:06,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1549192118, now seen corresponding path program 1 times [2018-11-10 03:46:06,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:06,379 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-10 03:46:06,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:06,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:06,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:06,380 INFO L87 Difference]: Start difference. First operand 44553 states and 62471 transitions. Second operand 3 states. [2018-11-10 03:46:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:06,724 INFO L93 Difference]: Finished difference Result 66829 states and 93449 transitions. [2018-11-10 03:46:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:06,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 03:46:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:06,766 INFO L225 Difference]: With dead ends: 66829 [2018-11-10 03:46:06,767 INFO L226 Difference]: Without dead ends: 45067 [2018-11-10 03:46:06,786 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-10 03:46:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45067 states. [2018-11-10 03:46:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45067 to 45065. [2018-11-10 03:46:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-11-10 03:46:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 62471 transitions. [2018-11-10 03:46:07,683 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 62471 transitions. Word has length 36 [2018-11-10 03:46:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:07,683 INFO L481 AbstractCegarLoop]: Abstraction has 45065 states and 62471 transitions. [2018-11-10 03:46:07,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 62471 transitions. [2018-11-10 03:46:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 03:46:07,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:07,705 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-10 03:46:07,705 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1056831436, now seen corresponding path program 1 times [2018-11-10 03:46:07,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:07,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:07,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:07,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:07,736 INFO L87 Difference]: Start difference. First operand 45065 states and 62471 transitions. Second operand 3 states. [2018-11-10 03:46:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:08,307 INFO L93 Difference]: Finished difference Result 77837 states and 110089 transitions. [2018-11-10 03:46:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:08,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 03:46:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:08,380 INFO L225 Difference]: With dead ends: 77837 [2018-11-10 03:46:08,380 INFO L226 Difference]: Without dead ends: 77835 [2018-11-10 03:46:08,396 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-10 03:46:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77835 states. [2018-11-10 03:46:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77835 to 66569. [2018-11-10 03:46:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66569 states. [2018-11-10 03:46:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66569 states to 66569 states and 89607 transitions. [2018-11-10 03:46:09,409 INFO L78 Accepts]: Start accepts. Automaton has 66569 states and 89607 transitions. Word has length 36 [2018-11-10 03:46:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:09,409 INFO L481 AbstractCegarLoop]: Abstraction has 66569 states and 89607 transitions. [2018-11-10 03:46:09,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 66569 states and 89607 transitions. [2018-11-10 03:46:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 03:46:09,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:09,435 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-10 03:46:09,435 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:09,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash -937313270, now seen corresponding path program 1 times [2018-11-10 03:46:09,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:09,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:09,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:09,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:09,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:09,467 INFO L87 Difference]: Start difference. First operand 66569 states and 89607 transitions. Second operand 3 states. [2018-11-10 03:46:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:10,197 INFO L93 Difference]: Finished difference Result 153613 states and 207369 transitions. [2018-11-10 03:46:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:10,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 03:46:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:10,271 INFO L225 Difference]: With dead ends: 153613 [2018-11-10 03:46:10,271 INFO L226 Difference]: Without dead ends: 88075 [2018-11-10 03:46:10,316 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-10 03:46:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88075 states. [2018-11-10 03:46:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88075 to 88073. [2018-11-10 03:46:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88073 states. [2018-11-10 03:46:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88073 states to 88073 states and 117767 transitions. [2018-11-10 03:46:11,846 INFO L78 Accepts]: Start accepts. Automaton has 88073 states and 117767 transitions. Word has length 36 [2018-11-10 03:46:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:11,846 INFO L481 AbstractCegarLoop]: Abstraction has 88073 states and 117767 transitions. [2018-11-10 03:46:11,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88073 states and 117767 transitions. [2018-11-10 03:46:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:46:11,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:11,880 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-10 03:46:11,880 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:11,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1597748681, now seen corresponding path program 1 times [2018-11-10 03:46:11,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:11,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:11,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:11,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:11,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:11,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:11,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:11,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:11,904 INFO L87 Difference]: Start difference. First operand 88073 states and 117767 transitions. Second operand 3 states. [2018-11-10 03:46:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:12,589 INFO L93 Difference]: Finished difference Result 132109 states and 176137 transitions. [2018-11-10 03:46:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:12,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 03:46:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:12,660 INFO L225 Difference]: With dead ends: 132109 [2018-11-10 03:46:12,660 INFO L226 Difference]: Without dead ends: 89099 [2018-11-10 03:46:12,691 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-10 03:46:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89099 states. [2018-11-10 03:46:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89099 to 89097. [2018-11-10 03:46:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89097 states. [2018-11-10 03:46:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89097 states to 89097 states and 117767 transitions. [2018-11-10 03:46:14,217 INFO L78 Accepts]: Start accepts. Automaton has 89097 states and 117767 transitions. Word has length 37 [2018-11-10 03:46:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:14,217 INFO L481 AbstractCegarLoop]: Abstraction has 89097 states and 117767 transitions. [2018-11-10 03:46:14,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 89097 states and 117767 transitions. [2018-11-10 03:46:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:46:14,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:14,247 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-10 03:46:14,247 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:14,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1008274873, now seen corresponding path program 1 times [2018-11-10 03:46:14,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:14,271 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-10 03:46:14,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:14,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:14,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:14,272 INFO L87 Difference]: Start difference. First operand 89097 states and 117767 transitions. Second operand 3 states. [2018-11-10 03:46:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:15,454 INFO L93 Difference]: Finished difference Result 151565 states and 203785 transitions. [2018-11-10 03:46:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:15,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 03:46:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:15,580 INFO L225 Difference]: With dead ends: 151565 [2018-11-10 03:46:15,580 INFO L226 Difference]: Without dead ends: 151563 [2018-11-10 03:46:15,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-10 03:46:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-10 03:46:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 133129. [2018-11-10 03:46:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133129 states. [2018-11-10 03:46:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133129 states to 133129 states and 171015 transitions. [2018-11-10 03:46:18,551 INFO L78 Accepts]: Start accepts. Automaton has 133129 states and 171015 transitions. Word has length 37 [2018-11-10 03:46:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:18,551 INFO L481 AbstractCegarLoop]: Abstraction has 133129 states and 171015 transitions. [2018-11-10 03:46:18,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 133129 states and 171015 transitions. [2018-11-10 03:46:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 03:46:18,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:18,611 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-10 03:46:18,611 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:18,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:18,611 INFO L82 PathProgramCache]: Analyzing trace with hash -985869833, now seen corresponding path program 1 times [2018-11-10 03:46:18,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:18,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:18,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:18,643 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-10 03:46:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:18,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:18,644 INFO L87 Difference]: Start difference. First operand 133129 states and 171015 transitions. Second operand 3 states. [2018-11-10 03:46:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:20,274 INFO L93 Difference]: Finished difference Result 305165 states and 392201 transitions. [2018-11-10 03:46:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:20,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 03:46:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:20,442 INFO L225 Difference]: With dead ends: 305165 [2018-11-10 03:46:20,442 INFO L226 Difference]: Without dead ends: 174091 [2018-11-10 03:46:20,849 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-10 03:46:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174091 states. [2018-11-10 03:46:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174091 to 174089. [2018-11-10 03:46:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174089 states. [2018-11-10 03:46:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174089 states to 174089 states and 221191 transitions. [2018-11-10 03:46:23,142 INFO L78 Accepts]: Start accepts. Automaton has 174089 states and 221191 transitions. Word has length 37 [2018-11-10 03:46:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:23,142 INFO L481 AbstractCegarLoop]: Abstraction has 174089 states and 221191 transitions. [2018-11-10 03:46:23,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 174089 states and 221191 transitions. [2018-11-10 03:46:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 03:46:23,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:23,208 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-10 03:46:23,208 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:23,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1191965503, now seen corresponding path program 1 times [2018-11-10 03:46:23,209 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:23,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:23,235 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-10 03:46:23,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:23,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:23,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:23,236 INFO L87 Difference]: Start difference. First operand 174089 states and 221191 transitions. Second operand 3 states. [2018-11-10 03:46:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:25,214 INFO L93 Difference]: Finished difference Result 261133 states and 330761 transitions. [2018-11-10 03:46:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:25,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 03:46:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:25,357 INFO L225 Difference]: With dead ends: 261133 [2018-11-10 03:46:25,357 INFO L226 Difference]: Without dead ends: 176139 [2018-11-10 03:46:25,410 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-10 03:46:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176139 states. [2018-11-10 03:46:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176139 to 176137. [2018-11-10 03:46:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176137 states. [2018-11-10 03:46:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176137 states to 176137 states and 221191 transitions. [2018-11-10 03:46:27,800 INFO L78 Accepts]: Start accepts. Automaton has 176137 states and 221191 transitions. Word has length 38 [2018-11-10 03:46:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:27,800 INFO L481 AbstractCegarLoop]: Abstraction has 176137 states and 221191 transitions. [2018-11-10 03:46:27,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 176137 states and 221191 transitions. [2018-11-10 03:46:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 03:46:27,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:27,866 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-10 03:46:27,866 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:27,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -496978239, now seen corresponding path program 1 times [2018-11-10 03:46:27,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:27,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:27,896 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-10 03:46:27,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:27,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:27,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:27,897 INFO L87 Difference]: Start difference. First operand 176137 states and 221191 transitions. Second operand 3 states. [2018-11-10 03:46:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:30,945 INFO L93 Difference]: Finished difference Result 516109 states and 638985 transitions. [2018-11-10 03:46:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:30,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 03:46:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:31,254 INFO L225 Difference]: With dead ends: 516109 [2018-11-10 03:46:31,254 INFO L226 Difference]: Without dead ends: 344075 [2018-11-10 03:46:31,358 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-10 03:46:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344075 states. [2018-11-10 03:46:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344075 to 344073. [2018-11-10 03:46:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-10 03:46:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 417799 transitions. [2018-11-10 03:46:36,155 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 417799 transitions. Word has length 38 [2018-11-10 03:46:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:36,155 INFO L481 AbstractCegarLoop]: Abstraction has 344073 states and 417799 transitions. [2018-11-10 03:46:36,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 417799 transitions. [2018-11-10 03:46:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 03:46:36,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:36,296 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-10 03:46:36,296 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:36,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1497166467, now seen corresponding path program 1 times [2018-11-10 03:46:36,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:36,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:36,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:36,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:36,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:36,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:36,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:36,332 INFO L87 Difference]: Start difference. First operand 344073 states and 417799 transitions. Second operand 3 states. [2018-11-10 03:46:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:42,434 INFO L93 Difference]: Finished difference Result 372749 states and 462857 transitions. [2018-11-10 03:46:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:42,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 03:46:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:42,776 INFO L225 Difference]: With dead ends: 372749 [2018-11-10 03:46:42,776 INFO L226 Difference]: Without dead ends: 372747 [2018-11-10 03:46:42,828 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-10 03:46:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372747 states. [2018-11-10 03:46:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372747 to 344073. [2018-11-10 03:46:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-10 03:46:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 413703 transitions. [2018-11-10 03:46:48,378 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 413703 transitions. Word has length 38 [2018-11-10 03:46:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:46:48,379 INFO L481 AbstractCegarLoop]: Abstraction has 344073 states and 413703 transitions. [2018-11-10 03:46:48,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:46:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 413703 transitions. [2018-11-10 03:46:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 03:46:48,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:46:48,533 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, 1] [2018-11-10 03:46:48,534 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:46:48,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1773759628, now seen corresponding path program 1 times [2018-11-10 03:46:48,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:48,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:48,560 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-10 03:46:48,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:48,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:46:48,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:46:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:46:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:46:48,561 INFO L87 Difference]: Start difference. First operand 344073 states and 413703 transitions. Second operand 3 states. [2018-11-10 03:46:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:54,261 INFO L93 Difference]: Finished difference Result 569357 states and 688137 transitions. [2018-11-10 03:46:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:46:54,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 03:46:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:46:54,751 INFO L225 Difference]: With dead ends: 569357 [2018-11-10 03:46:54,751 INFO L226 Difference]: Without dead ends: 569355 [2018-11-10 03:46:54,817 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-10 03:46:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569355 states. [2018-11-10 03:47:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569355 to 528393. [2018-11-10 03:47:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528393 states. [2018-11-10 03:47:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528393 states to 528393 states and 622599 transitions. [2018-11-10 03:47:04,888 INFO L78 Accepts]: Start accepts. Automaton has 528393 states and 622599 transitions. Word has length 39 [2018-11-10 03:47:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:04,888 INFO L481 AbstractCegarLoop]: Abstraction has 528393 states and 622599 transitions. [2018-11-10 03:47:04,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:47:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 528393 states and 622599 transitions. [2018-11-10 03:47:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 03:47:05,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:05,162 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, 1] [2018-11-10 03:47:05,163 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:05,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -220385078, now seen corresponding path program 1 times [2018-11-10 03:47:05,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:05,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:05,188 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-10 03:47:05,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:05,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:05,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:47:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:05,189 INFO L87 Difference]: Start difference. First operand 528393 states and 622599 transitions. Second operand 3 states. [2018-11-10 03:47:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:16,523 INFO L93 Difference]: Finished difference Result 1200141 states and 1409033 transitions. [2018-11-10 03:47:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:16,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 03:47:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:17,072 INFO L225 Difference]: With dead ends: 1200141 [2018-11-10 03:47:17,072 INFO L226 Difference]: Without dead ends: 675851 [2018-11-10 03:47:17,320 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-10 03:47:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675851 states. [2018-11-10 03:47:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675851 to 675849. [2018-11-10 03:47:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675849 states. [2018-11-10 03:47:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675849 states to 675849 states and 778247 transitions. [2018-11-10 03:47:28,440 INFO L78 Accepts]: Start accepts. Automaton has 675849 states and 778247 transitions. Word has length 39 [2018-11-10 03:47:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:28,440 INFO L481 AbstractCegarLoop]: Abstraction has 675849 states and 778247 transitions. [2018-11-10 03:47:28,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:47:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 675849 states and 778247 transitions. [2018-11-10 03:47:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 03:47:28,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:28,728 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, 1, 1] [2018-11-10 03:47:28,728 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:28,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -847810186, now seen corresponding path program 1 times [2018-11-10 03:47:28,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:28,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:28,748 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-10 03:47:28,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:28,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:28,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:47:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:28,748 INFO L87 Difference]: Start difference. First operand 675849 states and 778247 transitions. Second operand 3 states. [2018-11-10 03:47:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:40,191 INFO L93 Difference]: Finished difference Result 1019917 states and 1175561 transitions. [2018-11-10 03:47:40,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:40,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 03:47:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:40,795 INFO L225 Difference]: With dead ends: 1019917 [2018-11-10 03:47:40,795 INFO L226 Difference]: Without dead ends: 688139 [2018-11-10 03:47:41,020 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-10 03:47:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688139 states. [2018-11-10 03:47:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688139 to 688137. [2018-11-10 03:47:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688137 states. [2018-11-10 03:47:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688137 states to 688137 states and 786439 transitions. [2018-11-10 03:47:51,860 INFO L78 Accepts]: Start accepts. Automaton has 688137 states and 786439 transitions. Word has length 40 [2018-11-10 03:47:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:51,860 INFO L481 AbstractCegarLoop]: Abstraction has 688137 states and 786439 transitions. [2018-11-10 03:47:51,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:47:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 688137 states and 786439 transitions. [2018-11-10 03:47:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 03:47:52,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:52,105 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, 1, 1] [2018-11-10 03:47:52,105 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:52,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1758213368, now seen corresponding path program 1 times [2018-11-10 03:47:52,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:52,120 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-10 03:47:52,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:52,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:52,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:47:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:52,121 INFO L87 Difference]: Start difference. First operand 688137 states and 786439 transitions. Second operand 3 states. [2018-11-10 03:48:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:08,042 INFO L93 Difference]: Finished difference Result 1114123 states and 1261576 transitions. [2018-11-10 03:48:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:48:08,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 03:48:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:09,022 INFO L225 Difference]: With dead ends: 1114123 [2018-11-10 03:48:09,022 INFO L226 Difference]: Without dead ends: 1114121 [2018-11-10 03:48:09,140 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-10 03:48:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114121 states. [2018-11-10 03:48:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114121 to 1064969. [2018-11-10 03:48:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064969 states. [2018-11-10 03:48:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064969 states to 1064969 states and 1196039 transitions. [2018-11-10 03:48:23,820 INFO L78 Accepts]: Start accepts. Automaton has 1064969 states and 1196039 transitions. Word has length 40 [2018-11-10 03:48:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:23,820 INFO L481 AbstractCegarLoop]: Abstraction has 1064969 states and 1196039 transitions. [2018-11-10 03:48:23,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:48:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1064969 states and 1196039 transitions. [2018-11-10 03:48:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 03:48:24,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:48:24,328 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, 1, 1] [2018-11-10 03:48:24,328 INFO L424 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:48:24,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:48:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -235931338, now seen corresponding path program 1 times [2018-11-10 03:48:24,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:48:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:48:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:24,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:24,367 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-10 03:48:24,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:48:24,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:48:24,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:48:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:48:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:48:24,368 INFO L87 Difference]: Start difference. First operand 1064969 states and 1196039 transitions. Second operand 3 states. [2018-11-10 03:48:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:46,360 INFO L93 Difference]: Finished difference Result 2392073 states and 2654215 transitions. [2018-11-10 03:48:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:48:46,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 03:48:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:46,361 INFO L225 Difference]: With dead ends: 2392073 [2018-11-10 03:48:46,361 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:48:47,641 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-10 03:48:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:48:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:48:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:48:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:48:47,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-10 03:48:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:47,641 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:48:47,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:48:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:48:47,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:48:47,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:48:47,710 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:48:47,710 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,710 INFO L425 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L428 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-10 03:48:47,711 INFO L421 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L428 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,712 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-10 03:48:47,713 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,713 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,713 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,713 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 03:48:47,713 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-10 03:48:47,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:48:47 BoogieIcfgContainer [2018-11-10 03:48:47,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:48:47,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:48:47,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:48:47,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:48:47,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:45:58" (3/4) ... [2018-11-10 03:48:47,723 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:48:47,728 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:48:47,728 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:48:47,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 03:48:47,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 03:48:47,733 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:48:47,784 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_085f311c-824d-43f5-a5aa-f03ddf423ee9/bin-2019/uautomizer/witness.graphml [2018-11-10 03:48:47,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:48:47,785 INFO L168 Benchmark]: Toolchain (without parser) took 169603.65 ms. Allocated memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: 5.9 GB). Free memory was 960.3 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 03:48:47,787 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:48:47,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:48:47,788 INFO L168 Benchmark]: Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:48:47,788 INFO L168 Benchmark]: RCFGBuilder took 360.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:48:47,788 INFO L168 Benchmark]: TraceAbstraction took 168954.01 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 03:48:47,788 INFO L168 Benchmark]: Witness Printer took 65.30 ms. Allocated memory is still 7.0 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:48:47,790 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.35 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 360.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168954.01 ms. Allocated memory was 1.2 GB in the beginning and 7.0 GB in the end (delta: 5.8 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 65.30 ms. Allocated memory is still 7.0 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 60 locations, 1 error locations. SAFE Result, 168.8s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 92.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5286 SDtfs, 2640 SDslu, 3629 SDs, 0 SdLazy, 223 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064969occurred in iteration=41, 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: 73.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 163885 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1347 ConstructedInterpolants, 0 QuantifiedInterpolants, 91126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...