java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:43:13,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:43:13,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:43:13,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:43:13,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:43:13,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:43:13,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:43:13,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:43:13,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:43:13,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:43:13,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:43:13,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:43:13,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:43:13,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:43:13,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:43:13,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:43:13,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:43:13,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:43:13,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:43:13,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:43:13,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:43:13,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:43:13,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:43:13,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:43:13,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:43:13,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:43:13,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:43:13,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:43:13,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:43:13,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:43:13,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:43:13,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:43:13,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:43:13,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:43:13,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:43:13,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:43:13,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:43:13,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:43:13,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:43:13,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:43:13,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:43:13,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:43:13,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:43:13,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:43:13,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:43:13,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:43:13,813 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:43:13,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:43:13,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:43:13,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:43:13,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:43:13,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:43:13,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:43:13,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:43:13,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:43:13,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:43:13,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:43:13,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:43:13,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:43:13,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:43:13,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:43:13,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:43:13,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:43:13,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:43:13,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:43:13,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:43:13,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:43:13,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:43:13,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:43:13,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:43:13,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:43:13,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:43:13,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:43:13,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:43:13,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:43:13,872 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:43:13,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:43:13,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86afa488/d8063de9911c49f0a0072b795c58c6ab/FLAG10e9dd632 [2019-09-08 09:43:14,573 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:43:14,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:43:14,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86afa488/d8063de9911c49f0a0072b795c58c6ab/FLAG10e9dd632 [2019-09-08 09:43:14,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86afa488/d8063de9911c49f0a0072b795c58c6ab [2019-09-08 09:43:14,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:43:14,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:43:14,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:43:14,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:43:14,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:43:14,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:43:14" (1/1) ... [2019-09-08 09:43:14,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:14, skipping insertion in model container [2019-09-08 09:43:14,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:43:14" (1/1) ... [2019-09-08 09:43:14,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:43:14,988 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:43:16,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:43:16,439 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:43:17,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:43:17,262 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:43:17,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17 WrapperNode [2019-09-08 09:43:17,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:43:17,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:43:17,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:43:17,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:43:17,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... [2019-09-08 09:43:17,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:43:17,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:43:17,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:43:17,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:43:17,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-08 09:43:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:43:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:43:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:43:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:43:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:43:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:43:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:43:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:43:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:43:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:43:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:43:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:43:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:43:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:43:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:43:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:43:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:43:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:43:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:43:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:43:20,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:43:20,542 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:43:20,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:43:20 BoogieIcfgContainer [2019-09-08 09:43:20,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:43:20,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:43:20,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:43:20,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:43:20,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:43:14" (1/3) ... [2019-09-08 09:43:20,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bcbc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:43:20, skipping insertion in model container [2019-09-08 09:43:20,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:17" (2/3) ... [2019-09-08 09:43:20,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bcbc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:43:20, skipping insertion in model container [2019-09-08 09:43:20,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:43:20" (3/3) ... [2019-09-08 09:43:20,552 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:43:20,562 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:43:20,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:43:20,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:43:20,627 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:43:20,628 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:43:20,628 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:43:20,628 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:43:20,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:43:20,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:43:20,628 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:43:20,628 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:43:20,628 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:43:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states. [2019-09-08 09:43:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 09:43:20,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:20,700 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:20,703 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1783202097, now seen corresponding path program 1 times [2019-09-08 09:43:20,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:20,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:21,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:21,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:21,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:21,694 INFO L87 Difference]: Start difference. First operand 922 states. Second operand 3 states. [2019-09-08 09:43:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:22,070 INFO L93 Difference]: Finished difference Result 1604 states and 2863 transitions. [2019-09-08 09:43:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:22,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-08 09:43:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:22,115 INFO L225 Difference]: With dead ends: 1604 [2019-09-08 09:43:22,115 INFO L226 Difference]: Without dead ends: 1334 [2019-09-08 09:43:22,128 INFO L628 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 [2019-09-08 09:43:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-08 09:43:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1332. [2019-09-08 09:43:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-09-08 09:43:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2035 transitions. [2019-09-08 09:43:22,297 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2035 transitions. Word has length 296 [2019-09-08 09:43:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:22,299 INFO L475 AbstractCegarLoop]: Abstraction has 1332 states and 2035 transitions. [2019-09-08 09:43:22,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2035 transitions. [2019-09-08 09:43:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 09:43:22,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:22,308 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:22,309 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1233933969, now seen corresponding path program 1 times [2019-09-08 09:43:22,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:22,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:22,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:22,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:22,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:22,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:22,674 INFO L87 Difference]: Start difference. First operand 1332 states and 2035 transitions. Second operand 3 states. [2019-09-08 09:43:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:23,008 INFO L93 Difference]: Finished difference Result 2555 states and 3946 transitions. [2019-09-08 09:43:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:23,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-08 09:43:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:23,025 INFO L225 Difference]: With dead ends: 2555 [2019-09-08 09:43:23,025 INFO L226 Difference]: Without dead ends: 2184 [2019-09-08 09:43:23,030 INFO L628 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 [2019-09-08 09:43:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-08 09:43:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2182. [2019-09-08 09:43:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-09-08 09:43:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3346 transitions. [2019-09-08 09:43:23,138 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3346 transitions. Word has length 296 [2019-09-08 09:43:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:23,140 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3346 transitions. [2019-09-08 09:43:23,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3346 transitions. [2019-09-08 09:43:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 09:43:23,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:23,151 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:23,152 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1327845929, now seen corresponding path program 1 times [2019-09-08 09:43:23,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:23,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:23,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:24,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:24,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:24,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:24,027 INFO L87 Difference]: Start difference. First operand 2182 states and 3346 transitions. Second operand 4 states. [2019-09-08 09:43:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:24,404 INFO L93 Difference]: Finished difference Result 6447 states and 9879 transitions. [2019-09-08 09:43:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:24,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-08 09:43:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:24,426 INFO L225 Difference]: With dead ends: 6447 [2019-09-08 09:43:24,427 INFO L226 Difference]: Without dead ends: 4280 [2019-09-08 09:43:24,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2019-09-08 09:43:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4166. [2019-09-08 09:43:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-09-08 09:43:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6377 transitions. [2019-09-08 09:43:24,618 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6377 transitions. Word has length 296 [2019-09-08 09:43:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:24,619 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6377 transitions. [2019-09-08 09:43:24,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6377 transitions. [2019-09-08 09:43:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:43:24,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:24,632 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:24,633 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash -652490421, now seen corresponding path program 1 times [2019-09-08 09:43:24,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:24,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:24,868 INFO L87 Difference]: Start difference. First operand 4166 states and 6377 transitions. Second operand 3 states. [2019-09-08 09:43:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:25,252 INFO L93 Difference]: Finished difference Result 12214 states and 18653 transitions. [2019-09-08 09:43:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:25,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 09:43:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:25,294 INFO L225 Difference]: With dead ends: 12214 [2019-09-08 09:43:25,295 INFO L226 Difference]: Without dead ends: 8177 [2019-09-08 09:43:25,307 INFO L628 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 [2019-09-08 09:43:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8177 states. [2019-09-08 09:43:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8177 to 8063. [2019-09-08 09:43:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-09-08 09:43:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 12294 transitions. [2019-09-08 09:43:25,702 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 12294 transitions. Word has length 298 [2019-09-08 09:43:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:25,703 INFO L475 AbstractCegarLoop]: Abstraction has 8063 states and 12294 transitions. [2019-09-08 09:43:25,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 12294 transitions. [2019-09-08 09:43:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:43:25,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:25,724 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:25,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1799086512, now seen corresponding path program 1 times [2019-09-08 09:43:25,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:25,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:25,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:25,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:25,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:25,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:25,867 INFO L87 Difference]: Start difference. First operand 8063 states and 12294 transitions. Second operand 3 states. [2019-09-08 09:43:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:26,396 INFO L93 Difference]: Finished difference Result 24114 states and 36758 transitions. [2019-09-08 09:43:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:26,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 09:43:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:26,486 INFO L225 Difference]: With dead ends: 24114 [2019-09-08 09:43:26,487 INFO L226 Difference]: Without dead ends: 16093 [2019-09-08 09:43:26,516 INFO L628 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 [2019-09-08 09:43:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16093 states. [2019-09-08 09:43:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16093 to 8082. [2019-09-08 09:43:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8082 states. [2019-09-08 09:43:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8082 states to 8082 states and 12322 transitions. [2019-09-08 09:43:27,072 INFO L78 Accepts]: Start accepts. Automaton has 8082 states and 12322 transitions. Word has length 298 [2019-09-08 09:43:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:27,073 INFO L475 AbstractCegarLoop]: Abstraction has 8082 states and 12322 transitions. [2019-09-08 09:43:27,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8082 states and 12322 transitions. [2019-09-08 09:43:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 09:43:27,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:27,094 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:27,094 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash -249805897, now seen corresponding path program 1 times [2019-09-08 09:43:27,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:27,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:27,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:27,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:27,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:27,247 INFO L87 Difference]: Start difference. First operand 8082 states and 12322 transitions. Second operand 3 states. [2019-09-08 09:43:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:27,880 INFO L93 Difference]: Finished difference Result 24133 states and 36779 transitions. [2019-09-08 09:43:27,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:27,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-08 09:43:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:27,918 INFO L225 Difference]: With dead ends: 24133 [2019-09-08 09:43:27,918 INFO L226 Difference]: Without dead ends: 16111 [2019-09-08 09:43:27,936 INFO L628 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 [2019-09-08 09:43:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16111 states. [2019-09-08 09:43:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16111 to 8100. [2019-09-08 09:43:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-08 09:43:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 12343 transitions. [2019-09-08 09:43:28,356 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 12343 transitions. Word has length 299 [2019-09-08 09:43:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:28,358 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 12343 transitions. [2019-09-08 09:43:28,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 12343 transitions. [2019-09-08 09:43:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:43:28,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:28,378 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:28,379 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 582816003, now seen corresponding path program 1 times [2019-09-08 09:43:28,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:28,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:28,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:28,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:28,839 INFO L87 Difference]: Start difference. First operand 8100 states and 12343 transitions. Second operand 4 states. [2019-09-08 09:43:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:29,675 INFO L93 Difference]: Finished difference Result 23809 states and 36184 transitions. [2019-09-08 09:43:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:29,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-08 09:43:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:29,712 INFO L225 Difference]: With dead ends: 23809 [2019-09-08 09:43:29,712 INFO L226 Difference]: Without dead ends: 16038 [2019-09-08 09:43:29,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-09-08 09:43:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 8307. [2019-09-08 09:43:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-09-08 09:43:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 12696 transitions. [2019-09-08 09:43:30,269 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 12696 transitions. Word has length 300 [2019-09-08 09:43:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:30,270 INFO L475 AbstractCegarLoop]: Abstraction has 8307 states and 12696 transitions. [2019-09-08 09:43:30,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 12696 transitions. [2019-09-08 09:43:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:43:30,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:30,290 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:30,291 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1998808230, now seen corresponding path program 1 times [2019-09-08 09:43:30,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:30,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:30,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:30,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:30,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:30,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:30,514 INFO L87 Difference]: Start difference. First operand 8307 states and 12696 transitions. Second operand 3 states. [2019-09-08 09:43:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:31,328 INFO L93 Difference]: Finished difference Result 23091 states and 35124 transitions. [2019-09-08 09:43:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:31,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:43:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:31,376 INFO L225 Difference]: With dead ends: 23091 [2019-09-08 09:43:31,377 INFO L226 Difference]: Without dead ends: 15204 [2019-09-08 09:43:31,398 INFO L628 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 [2019-09-08 09:43:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2019-09-08 09:43:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15090. [2019-09-08 09:43:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15090 states. [2019-09-08 09:43:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15090 states to 15090 states and 22871 transitions. [2019-09-08 09:43:32,141 INFO L78 Accepts]: Start accepts. Automaton has 15090 states and 22871 transitions. Word has length 300 [2019-09-08 09:43:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:32,142 INFO L475 AbstractCegarLoop]: Abstraction has 15090 states and 22871 transitions. [2019-09-08 09:43:32,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15090 states and 22871 transitions. [2019-09-08 09:43:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:43:32,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:32,173 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:32,173 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1260366970, now seen corresponding path program 1 times [2019-09-08 09:43:32,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:32,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:32,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:32,341 INFO L87 Difference]: Start difference. First operand 15090 states and 22871 transitions. Second operand 3 states. [2019-09-08 09:43:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:33,303 INFO L93 Difference]: Finished difference Result 43700 states and 65894 transitions. [2019-09-08 09:43:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:33,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:43:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:33,374 INFO L225 Difference]: With dead ends: 43700 [2019-09-08 09:43:33,375 INFO L226 Difference]: Without dead ends: 29413 [2019-09-08 09:43:33,412 INFO L628 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 [2019-09-08 09:43:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29413 states. [2019-09-08 09:43:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29413 to 15194. [2019-09-08 09:43:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15194 states. [2019-09-08 09:43:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15194 states to 15194 states and 23014 transitions. [2019-09-08 09:43:34,982 INFO L78 Accepts]: Start accepts. Automaton has 15194 states and 23014 transitions. Word has length 302 [2019-09-08 09:43:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:34,983 INFO L475 AbstractCegarLoop]: Abstraction has 15194 states and 23014 transitions. [2019-09-08 09:43:34,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15194 states and 23014 transitions. [2019-09-08 09:43:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 09:43:35,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:35,010 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:35,010 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:35,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1610108247, now seen corresponding path program 1 times [2019-09-08 09:43:35,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:35,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:35,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:35,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:35,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:35,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:35,143 INFO L87 Difference]: Start difference. First operand 15194 states and 23014 transitions. Second operand 3 states. [2019-09-08 09:43:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:36,395 INFO L93 Difference]: Finished difference Result 43832 states and 66060 transitions. [2019-09-08 09:43:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-08 09:43:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:36,452 INFO L225 Difference]: With dead ends: 43832 [2019-09-08 09:43:36,452 INFO L226 Difference]: Without dead ends: 29538 [2019-09-08 09:43:36,478 INFO L628 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 [2019-09-08 09:43:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29538 states. [2019-09-08 09:43:37,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29538 to 15319. [2019-09-08 09:43:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-09-08 09:43:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 23160 transitions. [2019-09-08 09:43:37,265 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 23160 transitions. Word has length 303 [2019-09-08 09:43:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:37,266 INFO L475 AbstractCegarLoop]: Abstraction has 15319 states and 23160 transitions. [2019-09-08 09:43:37,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 23160 transitions. [2019-09-08 09:43:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:43:37,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:37,288 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:37,288 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1962608313, now seen corresponding path program 1 times [2019-09-08 09:43:37,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:37,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:37,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:37,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:37,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:37,727 INFO L87 Difference]: Start difference. First operand 15319 states and 23160 transitions. Second operand 4 states. [2019-09-08 09:43:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:38,740 INFO L93 Difference]: Finished difference Result 32025 states and 48395 transitions. [2019-09-08 09:43:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:38,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-08 09:43:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:38,765 INFO L225 Difference]: With dead ends: 32025 [2019-09-08 09:43:38,766 INFO L226 Difference]: Without dead ends: 16275 [2019-09-08 09:43:38,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-09-08 09:43:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 16161. [2019-09-08 09:43:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16161 states. [2019-09-08 09:43:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16161 states to 16161 states and 24331 transitions. [2019-09-08 09:43:39,520 INFO L78 Accepts]: Start accepts. Automaton has 16161 states and 24331 transitions. Word has length 304 [2019-09-08 09:43:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:39,520 INFO L475 AbstractCegarLoop]: Abstraction has 16161 states and 24331 transitions. [2019-09-08 09:43:39,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 16161 states and 24331 transitions. [2019-09-08 09:43:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:43:39,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:39,533 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:39,533 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 347631051, now seen corresponding path program 1 times [2019-09-08 09:43:39,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:39,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:39,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:39,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:39,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:39,665 INFO L87 Difference]: Start difference. First operand 16161 states and 24331 transitions. Second operand 3 states. [2019-09-08 09:43:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:41,200 INFO L93 Difference]: Finished difference Result 47517 states and 71355 transitions. [2019-09-08 09:43:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:41,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:43:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:41,247 INFO L225 Difference]: With dead ends: 47517 [2019-09-08 09:43:41,247 INFO L226 Difference]: Without dead ends: 31855 [2019-09-08 09:43:41,274 INFO L628 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 [2019-09-08 09:43:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31855 states. [2019-09-08 09:43:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31855 to 16231. [2019-09-08 09:43:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16231 states. [2019-09-08 09:43:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16231 states to 16231 states and 24422 transitions. [2019-09-08 09:43:42,137 INFO L78 Accepts]: Start accepts. Automaton has 16231 states and 24422 transitions. Word has length 306 [2019-09-08 09:43:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:42,137 INFO L475 AbstractCegarLoop]: Abstraction has 16231 states and 24422 transitions. [2019-09-08 09:43:42,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16231 states and 24422 transitions. [2019-09-08 09:43:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:43:42,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:42,149 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:42,149 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1086048075, now seen corresponding path program 1 times [2019-09-08 09:43:42,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:42,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:42,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:42,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:42,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:42,435 INFO L87 Difference]: Start difference. First operand 16231 states and 24422 transitions. Second operand 4 states. [2019-09-08 09:43:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:43,923 INFO L93 Difference]: Finished difference Result 47103 states and 70723 transitions. [2019-09-08 09:43:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:43,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:43:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:43,964 INFO L225 Difference]: With dead ends: 47103 [2019-09-08 09:43:43,964 INFO L226 Difference]: Without dead ends: 32189 [2019-09-08 09:43:43,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32189 states. [2019-09-08 09:43:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32189 to 17068. [2019-09-08 09:43:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17068 states. [2019-09-08 09:43:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17068 states to 17068 states and 25811 transitions. [2019-09-08 09:43:45,198 INFO L78 Accepts]: Start accepts. Automaton has 17068 states and 25811 transitions. Word has length 306 [2019-09-08 09:43:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:45,199 INFO L475 AbstractCegarLoop]: Abstraction has 17068 states and 25811 transitions. [2019-09-08 09:43:45,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 17068 states and 25811 transitions. [2019-09-08 09:43:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:43:45,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:45,213 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:45,213 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1786389507, now seen corresponding path program 1 times [2019-09-08 09:43:45,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:45,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:45,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:45,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:45,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:45,467 INFO L87 Difference]: Start difference. First operand 17068 states and 25811 transitions. Second operand 3 states. [2019-09-08 09:43:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:46,956 INFO L93 Difference]: Finished difference Result 49042 states and 73847 transitions. [2019-09-08 09:43:46,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:46,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:43:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:46,996 INFO L225 Difference]: With dead ends: 49042 [2019-09-08 09:43:46,997 INFO L226 Difference]: Without dead ends: 33118 [2019-09-08 09:43:47,024 INFO L628 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 [2019-09-08 09:43:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33118 states. [2019-09-08 09:43:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33118 to 33024. [2019-09-08 09:43:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33024 states. [2019-09-08 09:43:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33024 states to 33024 states and 49548 transitions. [2019-09-08 09:43:49,386 INFO L78 Accepts]: Start accepts. Automaton has 33024 states and 49548 transitions. Word has length 306 [2019-09-08 09:43:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:49,386 INFO L475 AbstractCegarLoop]: Abstraction has 33024 states and 49548 transitions. [2019-09-08 09:43:49,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33024 states and 49548 transitions. [2019-09-08 09:43:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:43:49,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:49,419 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:49,420 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1280012922, now seen corresponding path program 1 times [2019-09-08 09:43:49,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:49,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:49,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:49,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:49,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:49,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:49,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:49,554 INFO L87 Difference]: Start difference. First operand 33024 states and 49548 transitions. Second operand 3 states. [2019-09-08 09:43:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:52,886 INFO L93 Difference]: Finished difference Result 95838 states and 143300 transitions. [2019-09-08 09:43:52,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:52,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-08 09:43:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:52,964 INFO L225 Difference]: With dead ends: 95838 [2019-09-08 09:43:52,964 INFO L226 Difference]: Without dead ends: 64475 [2019-09-08 09:43:53,001 INFO L628 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 [2019-09-08 09:43:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64475 states. [2019-09-08 09:43:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64475 to 33316. [2019-09-08 09:43:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33316 states. [2019-09-08 09:43:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33316 states to 33316 states and 49886 transitions. [2019-09-08 09:43:56,057 INFO L78 Accepts]: Start accepts. Automaton has 33316 states and 49886 transitions. Word has length 307 [2019-09-08 09:43:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:56,057 INFO L475 AbstractCegarLoop]: Abstraction has 33316 states and 49886 transitions. [2019-09-08 09:43:56,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33316 states and 49886 transitions. [2019-09-08 09:43:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:56,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:56,081 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:56,082 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 151142115, now seen corresponding path program 1 times [2019-09-08 09:43:56,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:56,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:56,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:56,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:56,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:56,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:56,339 INFO L87 Difference]: Start difference. First operand 33316 states and 49886 transitions. Second operand 3 states. [2019-09-08 09:43:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:59,737 INFO L93 Difference]: Finished difference Result 64804 states and 98087 transitions. [2019-09-08 09:43:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:59,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:43:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:59,798 INFO L225 Difference]: With dead ends: 64804 [2019-09-08 09:43:59,798 INFO L226 Difference]: Without dead ends: 56692 [2019-09-08 09:43:59,817 INFO L628 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 [2019-09-08 09:43:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56692 states. [2019-09-08 09:44:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56692 to 56608. [2019-09-08 09:44:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56608 states. [2019-09-08 09:44:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56608 states to 56608 states and 84671 transitions. [2019-09-08 09:44:04,026 INFO L78 Accepts]: Start accepts. Automaton has 56608 states and 84671 transitions. Word has length 308 [2019-09-08 09:44:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:04,026 INFO L475 AbstractCegarLoop]: Abstraction has 56608 states and 84671 transitions. [2019-09-08 09:44:04,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 56608 states and 84671 transitions. [2019-09-08 09:44:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:44:04,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:04,066 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:04,066 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 150803491, now seen corresponding path program 1 times [2019-09-08 09:44:04,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:04,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:44:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:44:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:44:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:44:05,111 INFO L87 Difference]: Start difference. First operand 56608 states and 84671 transitions. Second operand 17 states. [2019-09-08 09:44:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:20,202 INFO L93 Difference]: Finished difference Result 176672 states and 268120 transitions. [2019-09-08 09:44:20,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:44:20,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 308 [2019-09-08 09:44:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:20,364 INFO L225 Difference]: With dead ends: 176672 [2019-09-08 09:44:20,364 INFO L226 Difference]: Without dead ends: 157352 [2019-09-08 09:44:20,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:44:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157352 states. [2019-09-08 09:44:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157352 to 110172. [2019-09-08 09:44:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110172 states. [2019-09-08 09:44:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110172 states to 110172 states and 163285 transitions. [2019-09-08 09:44:28,096 INFO L78 Accepts]: Start accepts. Automaton has 110172 states and 163285 transitions. Word has length 308 [2019-09-08 09:44:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:28,096 INFO L475 AbstractCegarLoop]: Abstraction has 110172 states and 163285 transitions. [2019-09-08 09:44:28,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:44:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 110172 states and 163285 transitions. [2019-09-08 09:44:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:44:28,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:28,174 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:28,174 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1283932160, now seen corresponding path program 1 times [2019-09-08 09:44:28,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:28,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:28,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:28,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:44:28,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:44:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:44:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:28,618 INFO L87 Difference]: Start difference. First operand 110172 states and 163285 transitions. Second operand 4 states. [2019-09-08 09:44:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:44,506 INFO L93 Difference]: Finished difference Result 322614 states and 477049 transitions. [2019-09-08 09:44:44,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:44,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:44:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:44,800 INFO L225 Difference]: With dead ends: 322614 [2019-09-08 09:44:44,800 INFO L226 Difference]: Without dead ends: 213650 [2019-09-08 09:44:44,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:44:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213650 states. [2019-09-08 09:45:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213650 to 213474. [2019-09-08 09:45:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213474 states. [2019-09-08 09:45:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213474 states to 213474 states and 313786 transitions. [2019-09-08 09:45:03,420 INFO L78 Accepts]: Start accepts. Automaton has 213474 states and 313786 transitions. Word has length 308 [2019-09-08 09:45:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:03,420 INFO L475 AbstractCegarLoop]: Abstraction has 213474 states and 313786 transitions. [2019-09-08 09:45:03,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 213474 states and 313786 transitions. [2019-09-08 09:45:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:45:03,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:03,595 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:03,596 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash 326591893, now seen corresponding path program 1 times [2019-09-08 09:45:03,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:03,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:03,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:45:03,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:45:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:45:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:45:03,976 INFO L87 Difference]: Start difference. First operand 213474 states and 313786 transitions. Second operand 4 states. [2019-09-08 09:45:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:40,243 INFO L93 Difference]: Finished difference Result 630102 states and 924725 transitions. [2019-09-08 09:45:40,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:45:40,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:45:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:40,773 INFO L225 Difference]: With dead ends: 630102 [2019-09-08 09:45:40,773 INFO L226 Difference]: Without dead ends: 417026 [2019-09-08 09:45:40,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:45:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417026 states. [2019-09-08 09:46:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417026 to 416762. [2019-09-08 09:46:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416762 states. [2019-09-08 09:46:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416762 states to 416762 states and 607665 transitions. [2019-09-08 09:46:23,767 INFO L78 Accepts]: Start accepts. Automaton has 416762 states and 607665 transitions. Word has length 308 [2019-09-08 09:46:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:23,767 INFO L475 AbstractCegarLoop]: Abstraction has 416762 states and 607665 transitions. [2019-09-08 09:46:23,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 416762 states and 607665 transitions. [2019-09-08 09:46:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:46:24,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:24,072 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:46:24,072 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1083050158, now seen corresponding path program 1 times [2019-09-08 09:46:24,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:24,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:24,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:24,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:24,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:24,264 INFO L87 Difference]: Start difference. First operand 416762 states and 607665 transitions. Second operand 3 states. [2019-09-08 09:47:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:37,629 INFO L93 Difference]: Finished difference Result 1228280 states and 1787917 transitions. [2019-09-08 09:47:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:37,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:47:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:38,951 INFO L225 Difference]: With dead ends: 1228280 [2019-09-08 09:47:38,951 INFO L226 Difference]: Without dead ends: 816294 [2019-09-08 09:47:39,338 INFO L628 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 [2019-09-08 09:47:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816294 states. [2019-09-08 09:49:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816294 to 816030. [2019-09-08 09:49:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816030 states. [2019-09-08 09:49:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816030 states to 816030 states and 1180269 transitions. [2019-09-08 09:49:15,103 INFO L78 Accepts]: Start accepts. Automaton has 816030 states and 1180269 transitions. Word has length 310 [2019-09-08 09:49:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:15,103 INFO L475 AbstractCegarLoop]: Abstraction has 816030 states and 1180269 transitions. [2019-09-08 09:49:15,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:49:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 816030 states and 1180269 transitions. [2019-09-08 09:49:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:49:15,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:15,762 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:49:15,763 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash -63545933, now seen corresponding path program 1 times [2019-09-08 09:49:15,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:15,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:15,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:15,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:49:15,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:15,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:49:15,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:49:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:49:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:49:15,896 INFO L87 Difference]: Start difference. First operand 816030 states and 1180269 transitions. Second operand 3 states. [2019-09-08 09:52:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:03,698 INFO L93 Difference]: Finished difference Result 2440242 states and 3528423 transitions. [2019-09-08 09:52:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:03,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:52:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:06,226 INFO L225 Difference]: With dead ends: 2440242 [2019-09-08 09:52:06,226 INFO L226 Difference]: Without dead ends: 1625368 [2019-09-08 09:52:06,986 INFO L628 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 [2019-09-08 09:52:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625368 states.