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.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:02:40,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:02:40,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:02:40,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:02:40,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:02:40,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:02:40,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:02:40,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:02:40,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:02:40,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:02:40,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:02:40,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:02:40,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:02:40,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:02:40,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:02:40,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:02:40,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:02:40,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:02:40,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:02:40,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:02:40,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:02:40,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:02:40,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:02:40,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:02:40,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:02:40,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:02:40,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:02:40,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:02:40,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:02:40,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:02:40,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:02:40,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:02:40,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:02:40,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:02:40,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:02:40,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:02:40,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:02:40,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:02:40,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:02:40,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:02:40,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:02:40,548 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 10:02:40,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:02:40,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:02:40,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:02:40,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:02:40,573 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:02:40,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:02:40,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:02:40,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:02:40,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:02:40,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:02:40,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:02:40,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:02:40,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:02:40,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:02:40,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:02:40,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:02:40,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:02:40,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:02:40,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:02:40,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:02:40,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:02:40,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:02:40,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:02:40,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:02:40,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:02:40,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:02:40,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:02:40,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:02:40,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:02:40,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:02:40,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:02:40,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:02:40,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:02:40,629 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:02:40,629 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.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:02:40,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8436f1/a94e8806776547ab8c9aca389e0b581d/FLAG07b104af8 [2019-09-08 10:02:41,368 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:02:41,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:02:41,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8436f1/a94e8806776547ab8c9aca389e0b581d/FLAG07b104af8 [2019-09-08 10:02:41,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd8436f1/a94e8806776547ab8c9aca389e0b581d [2019-09-08 10:02:41,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:02:41,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:02:41,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:41,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:02:41,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:02:41,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:41" (1/1) ... [2019-09-08 10:02:41,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30948aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:41, skipping insertion in model container [2019-09-08 10:02:41,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:41" (1/1) ... [2019-09-08 10:02:41,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:02:41,691 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:02:42,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:42,951 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:02:43,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:43,908 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:02:43,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43 WrapperNode [2019-09-08 10:02:43,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:43,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:02:43,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:02:43,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:02:43,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:43,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:43,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:43,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:44,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:44,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:44,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (1/1) ... [2019-09-08 10:02:44,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:02:44,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:02:44,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:02:44,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:02:44,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (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 10:02:44,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:02:44,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:02:44,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:02:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:02:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:02:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:02:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:02:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:02:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:02:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:02:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:02:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:02:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:02:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:02:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:02:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:02:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:02:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:02:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:02:47,711 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:02:47,713 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:02:47,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:47 BoogieIcfgContainer [2019-09-08 10:02:47,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:02:47,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:02:47,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:02:47,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:02:47,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:02:41" (1/3) ... [2019-09-08 10:02:47,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358adf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:47, skipping insertion in model container [2019-09-08 10:02:47,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:43" (2/3) ... [2019-09-08 10:02:47,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358adf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:47, skipping insertion in model container [2019-09-08 10:02:47,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:47" (3/3) ... [2019-09-08 10:02:47,729 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:02:47,740 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:02:47,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 10:02:47,789 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 10:02:47,839 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:02:47,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:02:47,840 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:02:47,840 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:02:47,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:02:47,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:02:47,840 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:02:47,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:02:47,841 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:02:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states. [2019-09-08 10:02:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 10:02:47,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:47,928 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 10:02:47,932 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1092745861, now seen corresponding path program 1 times [2019-09-08 10:02:47,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:47,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:48,929 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 10:02:48,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:48,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:48,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:48,956 INFO L87 Difference]: Start difference. First operand 910 states. Second operand 3 states. [2019-09-08 10:02:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:49,455 INFO L93 Difference]: Finished difference Result 1605 states and 2877 transitions. [2019-09-08 10:02:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:49,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 10:02:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:49,492 INFO L225 Difference]: With dead ends: 1605 [2019-09-08 10:02:49,492 INFO L226 Difference]: Without dead ends: 1402 [2019-09-08 10:02:49,498 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 10:02:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-09-08 10:02:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1400. [2019-09-08 10:02:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-09-08 10:02:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2161 transitions. [2019-09-08 10:02:49,667 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2161 transitions. Word has length 302 [2019-09-08 10:02:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:49,672 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 2161 transitions. [2019-09-08 10:02:49,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2161 transitions. [2019-09-08 10:02:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 10:02:49,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:49,683 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 10:02:49,683 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1093084485, now seen corresponding path program 1 times [2019-09-08 10:02:49,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:49,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:49,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:50,699 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 10:02:50,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:50,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:50,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:50,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:50,705 INFO L87 Difference]: Start difference. First operand 1400 states and 2161 transitions. Second operand 4 states. [2019-09-08 10:02:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:51,003 INFO L93 Difference]: Finished difference Result 4135 states and 6380 transitions. [2019-09-08 10:02:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:02:51,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 10:02:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:51,026 INFO L225 Difference]: With dead ends: 4135 [2019-09-08 10:02:51,027 INFO L226 Difference]: Without dead ends: 2750 [2019-09-08 10:02:51,037 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 10:02:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-09-08 10:02:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2608. [2019-09-08 10:02:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-09-08 10:02:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 4024 transitions. [2019-09-08 10:02:51,211 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 4024 transitions. Word has length 302 [2019-09-08 10:02:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:51,212 INFO L475 AbstractCegarLoop]: Abstraction has 2608 states and 4024 transitions. [2019-09-08 10:02:51,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 4024 transitions. [2019-09-08 10:02:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 10:02:51,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:51,222 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 10:02:51,223 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1873824137, now seen corresponding path program 1 times [2019-09-08 10:02:51,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:51,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:51,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:51,592 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 10:02:51,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:51,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:51,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:51,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:51,595 INFO L87 Difference]: Start difference. First operand 2608 states and 4024 transitions. Second operand 3 states. [2019-09-08 10:02:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:51,904 INFO L93 Difference]: Finished difference Result 7607 states and 11704 transitions. [2019-09-08 10:02:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:51,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 10:02:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:51,939 INFO L225 Difference]: With dead ends: 7607 [2019-09-08 10:02:51,939 INFO L226 Difference]: Without dead ends: 5128 [2019-09-08 10:02:51,949 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 10:02:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2019-09-08 10:02:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 4986. [2019-09-08 10:02:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-09-08 10:02:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 7674 transitions. [2019-09-08 10:02:52,205 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 7674 transitions. Word has length 304 [2019-09-08 10:02:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:52,206 INFO L475 AbstractCegarLoop]: Abstraction has 4986 states and 7674 transitions. [2019-09-08 10:02:52,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 7674 transitions. [2019-09-08 10:02:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 10:02:52,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:52,223 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 10:02:52,224 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:52,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1199834830, now seen corresponding path program 1 times [2019-09-08 10:02:52,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:52,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:52,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:52,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:52,447 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 10:02:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:52,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:52,449 INFO L87 Difference]: Start difference. First operand 4986 states and 7674 transitions. Second operand 3 states. [2019-09-08 10:02:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:52,892 INFO L93 Difference]: Finished difference Result 14883 states and 22898 transitions. [2019-09-08 10:02:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:52,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 10:02:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:52,945 INFO L225 Difference]: With dead ends: 14883 [2019-09-08 10:02:52,945 INFO L226 Difference]: Without dead ends: 9939 [2019-09-08 10:02:52,961 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 10:02:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2019-09-08 10:02:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 5005. [2019-09-08 10:02:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5005 states. [2019-09-08 10:02:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 7702 transitions. [2019-09-08 10:02:53,382 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 7702 transitions. Word has length 304 [2019-09-08 10:02:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:53,383 INFO L475 AbstractCegarLoop]: Abstraction has 5005 states and 7702 transitions. [2019-09-08 10:02:53,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 7702 transitions. [2019-09-08 10:02:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 10:02:53,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:53,399 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] [2019-09-08 10:02:53,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -747414031, now seen corresponding path program 1 times [2019-09-08 10:02:53,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:53,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:53,585 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 10:02:53,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:53,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:53,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:53,587 INFO L87 Difference]: Start difference. First operand 5005 states and 7702 transitions. Second operand 3 states. [2019-09-08 10:02:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:54,066 INFO L93 Difference]: Finished difference Result 14902 states and 22919 transitions. [2019-09-08 10:02:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:54,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 10:02:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:54,125 INFO L225 Difference]: With dead ends: 14902 [2019-09-08 10:02:54,126 INFO L226 Difference]: Without dead ends: 9957 [2019-09-08 10:02:54,138 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 10:02:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2019-09-08 10:02:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 5023. [2019-09-08 10:02:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-09-08 10:02:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 7723 transitions. [2019-09-08 10:02:54,462 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 7723 transitions. Word has length 305 [2019-09-08 10:02:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:54,463 INFO L475 AbstractCegarLoop]: Abstraction has 5023 states and 7723 transitions. [2019-09-08 10:02:54,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 7723 transitions. [2019-09-08 10:02:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 10:02:54,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:54,476 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 10:02:54,476 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1395518428, now seen corresponding path program 1 times [2019-09-08 10:02:54,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:54,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:54,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:54,813 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 10:02:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:54,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:54,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:54,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:54,815 INFO L87 Difference]: Start difference. First operand 5023 states and 7723 transitions. Second operand 3 states. [2019-09-08 10:02:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:55,299 INFO L93 Difference]: Finished difference Result 14558 states and 22314 transitions. [2019-09-08 10:02:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:55,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 10:02:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:55,322 INFO L225 Difference]: With dead ends: 14558 [2019-09-08 10:02:55,322 INFO L226 Difference]: Without dead ends: 9780 [2019-09-08 10:02:55,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 10:02:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-09-08 10:02:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9638. [2019-09-08 10:02:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2019-09-08 10:02:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 14739 transitions. [2019-09-08 10:02:55,832 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 14739 transitions. Word has length 306 [2019-09-08 10:02:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:55,833 INFO L475 AbstractCegarLoop]: Abstraction has 9638 states and 14739 transitions. [2019-09-08 10:02:55,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 14739 transitions. [2019-09-08 10:02:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 10:02:55,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:55,858 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 10:02:55,859 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1763591873, now seen corresponding path program 1 times [2019-09-08 10:02:55,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:55,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:55,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:56,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 10:02:56,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:56,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:56,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:56,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:56,514 INFO L87 Difference]: Start difference. First operand 9638 states and 14739 transitions. Second operand 4 states. [2019-09-08 10:02:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:57,434 INFO L93 Difference]: Finished difference Result 26935 states and 40996 transitions. [2019-09-08 10:02:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:02:57,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 10:02:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:57,476 INFO L225 Difference]: With dead ends: 26935 [2019-09-08 10:02:57,476 INFO L226 Difference]: Without dead ends: 17837 [2019-09-08 10:02:57,505 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 10:02:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17837 states. [2019-09-08 10:02:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17837 to 9873. [2019-09-08 10:02:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9873 states. [2019-09-08 10:02:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 15127 transitions. [2019-09-08 10:02:58,769 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 15127 transitions. Word has length 306 [2019-09-08 10:02:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:58,769 INFO L475 AbstractCegarLoop]: Abstraction has 9873 states and 15127 transitions. [2019-09-08 10:02:58,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 15127 transitions. [2019-09-08 10:02:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 10:02:58,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:58,792 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 10:02:58,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1458963152, now seen corresponding path program 1 times [2019-09-08 10:02:58,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:58,962 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 10:02:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:58,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:58,965 INFO L87 Difference]: Start difference. First operand 9873 states and 15127 transitions. Second operand 3 states. [2019-09-08 10:02:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:59,882 INFO L93 Difference]: Finished difference Result 28049 states and 42662 transitions. [2019-09-08 10:02:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 10:02:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:59,929 INFO L225 Difference]: With dead ends: 28049 [2019-09-08 10:02:59,929 INFO L226 Difference]: Without dead ends: 18979 [2019-09-08 10:02:59,956 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 10:02:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18979 states. [2019-09-08 10:03:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18979 to 9977. [2019-09-08 10:03:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9977 states. [2019-09-08 10:03:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9977 states to 9977 states and 15270 transitions. [2019-09-08 10:03:00,624 INFO L78 Accepts]: Start accepts. Automaton has 9977 states and 15270 transitions. Word has length 308 [2019-09-08 10:03:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:00,625 INFO L475 AbstractCegarLoop]: Abstraction has 9977 states and 15270 transitions. [2019-09-08 10:03:00,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9977 states and 15270 transitions. [2019-09-08 10:03:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 10:03:00,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:00,646 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] [2019-09-08 10:03:00,647 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 399951671, now seen corresponding path program 1 times [2019-09-08 10:03:00,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:00,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:00,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:00,796 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 10:03:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:00,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:00,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:00,798 INFO L87 Difference]: Start difference. First operand 9977 states and 15270 transitions. Second operand 3 states. [2019-09-08 10:03:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:01,976 INFO L93 Difference]: Finished difference Result 28181 states and 42828 transitions. [2019-09-08 10:03:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:01,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-08 10:03:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:02,032 INFO L225 Difference]: With dead ends: 28181 [2019-09-08 10:03:02,032 INFO L226 Difference]: Without dead ends: 19104 [2019-09-08 10:03:02,066 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 10:03:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19104 states. [2019-09-08 10:03:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19104 to 10102. [2019-09-08 10:03:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10102 states. [2019-09-08 10:03:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10102 states to 10102 states and 15416 transitions. [2019-09-08 10:03:02,832 INFO L78 Accepts]: Start accepts. Automaton has 10102 states and 15416 transitions. Word has length 309 [2019-09-08 10:03:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:02,832 INFO L475 AbstractCegarLoop]: Abstraction has 10102 states and 15416 transitions. [2019-09-08 10:03:02,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10102 states and 15416 transitions. [2019-09-08 10:03:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 10:03:02,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:02,861 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 10:03:02,862 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:02,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 549610147, now seen corresponding path program 1 times [2019-09-08 10:03:02,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:03,360 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 10:03:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:03,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:03,362 INFO L87 Difference]: Start difference. First operand 10102 states and 15416 transitions. Second operand 4 states. [2019-09-08 10:03:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:03,994 INFO L93 Difference]: Finished difference Result 18151 states and 27577 transitions. [2019-09-08 10:03:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:03,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-08 10:03:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:04,013 INFO L225 Difference]: With dead ends: 18151 [2019-09-08 10:03:04,014 INFO L226 Difference]: Without dead ends: 8912 [2019-09-08 10:03:04,031 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 10:03:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8912 states. [2019-09-08 10:03:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8912 to 8892. [2019-09-08 10:03:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8892 states. [2019-09-08 10:03:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 13578 transitions. [2019-09-08 10:03:04,611 INFO L78 Accepts]: Start accepts. Automaton has 8892 states and 13578 transitions. Word has length 310 [2019-09-08 10:03:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:04,611 INFO L475 AbstractCegarLoop]: Abstraction has 8892 states and 13578 transitions. [2019-09-08 10:03:04,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8892 states and 13578 transitions. [2019-09-08 10:03:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 10:03:04,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:04,638 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, 1, 1, 1, 1] [2019-09-08 10:03:04,639 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1515996479, now seen corresponding path program 1 times [2019-09-08 10:03:04,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:05,156 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 10:03:05,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:03:05,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:03:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:03:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:03:05,159 INFO L87 Difference]: Start difference. First operand 8892 states and 13578 transitions. Second operand 9 states. [2019-09-08 10:03:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:06,534 INFO L93 Difference]: Finished difference Result 16216 states and 24979 transitions. [2019-09-08 10:03:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:06,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-08 10:03:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:06,570 INFO L225 Difference]: With dead ends: 16216 [2019-09-08 10:03:06,571 INFO L226 Difference]: Without dead ends: 14109 [2019-09-08 10:03:06,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:03:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-09-08 10:03:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 14107. [2019-09-08 10:03:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14107 states. [2019-09-08 10:03:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 21416 transitions. [2019-09-08 10:03:07,450 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 21416 transitions. Word has length 314 [2019-09-08 10:03:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:07,451 INFO L475 AbstractCegarLoop]: Abstraction has 14107 states and 21416 transitions. [2019-09-08 10:03:07,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:03:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 21416 transitions. [2019-09-08 10:03:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 10:03:07,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:07,490 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, 1, 1, 1, 1] [2019-09-08 10:03:07,490 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -479267222, now seen corresponding path program 1 times [2019-09-08 10:03:07,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:08,770 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 10:03:08,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:08,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:03:08,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:03:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:03:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:03:08,775 INFO L87 Difference]: Start difference. First operand 14107 states and 21416 transitions. Second operand 14 states. [2019-09-08 10:03:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:14,553 INFO L93 Difference]: Finished difference Result 42506 states and 64854 transitions. [2019-09-08 10:03:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:03:14,554 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 314 [2019-09-08 10:03:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:14,610 INFO L225 Difference]: With dead ends: 42506 [2019-09-08 10:03:14,610 INFO L226 Difference]: Without dead ends: 40886 [2019-09-08 10:03:14,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:03:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40886 states. [2019-09-08 10:03:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40886 to 16415. [2019-09-08 10:03:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16415 states. [2019-09-08 10:03:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16415 states to 16415 states and 24680 transitions. [2019-09-08 10:03:16,401 INFO L78 Accepts]: Start accepts. Automaton has 16415 states and 24680 transitions. Word has length 314 [2019-09-08 10:03:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:16,401 INFO L475 AbstractCegarLoop]: Abstraction has 16415 states and 24680 transitions. [2019-09-08 10:03:16,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:03:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 16415 states and 24680 transitions. [2019-09-08 10:03:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 10:03:16,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:16,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:16,419 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1286224969, now seen corresponding path program 1 times [2019-09-08 10:03:16,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:16,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:16,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:16,964 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 10:03:16,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:16,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:16,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:16,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:16,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:16,967 INFO L87 Difference]: Start difference. First operand 16415 states and 24680 transitions. Second operand 4 states. [2019-09-08 10:03:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:18,706 INFO L93 Difference]: Finished difference Result 48293 states and 72493 transitions. [2019-09-08 10:03:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:18,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 10:03:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:18,757 INFO L225 Difference]: With dead ends: 48293 [2019-09-08 10:03:18,757 INFO L226 Difference]: Without dead ends: 31950 [2019-09-08 10:03:18,791 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 10:03:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31950 states. [2019-09-08 10:03:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31950 to 31814. [2019-09-08 10:03:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31814 states. [2019-09-08 10:03:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31814 states to 31814 states and 47457 transitions. [2019-09-08 10:03:21,499 INFO L78 Accepts]: Start accepts. Automaton has 31814 states and 47457 transitions. Word has length 314 [2019-09-08 10:03:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:21,500 INFO L475 AbstractCegarLoop]: Abstraction has 31814 states and 47457 transitions. [2019-09-08 10:03:21,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 31814 states and 47457 transitions. [2019-09-08 10:03:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 10:03:21,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:21,527 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, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:21,527 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 586568706, now seen corresponding path program 1 times [2019-09-08 10:03:21,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:22,521 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 10:03:22,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:22,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:22,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:22,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:22,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:22,523 INFO L87 Difference]: Start difference. First operand 31814 states and 47457 transitions. Second operand 3 states. [2019-09-08 10:03:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:25,826 INFO L93 Difference]: Finished difference Result 92484 states and 137439 transitions. [2019-09-08 10:03:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:25,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 10:03:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:25,889 INFO L225 Difference]: With dead ends: 92484 [2019-09-08 10:03:25,889 INFO L226 Difference]: Without dead ends: 61919 [2019-09-08 10:03:25,917 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 10:03:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61919 states. [2019-09-08 10:03:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61919 to 61787. [2019-09-08 10:03:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61787 states. [2019-09-08 10:03:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61787 states to 61787 states and 91399 transitions. [2019-09-08 10:03:30,836 INFO L78 Accepts]: Start accepts. Automaton has 61787 states and 91399 transitions. Word has length 316 [2019-09-08 10:03:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:30,837 INFO L475 AbstractCegarLoop]: Abstraction has 61787 states and 91399 transitions. [2019-09-08 10:03:30,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 61787 states and 91399 transitions. [2019-09-08 10:03:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 10:03:30,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:30,891 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:30,892 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1854737059, now seen corresponding path program 1 times [2019-09-08 10:03:30,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:30,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:31,129 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 10:03:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:31,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:31,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:31,131 INFO L87 Difference]: Start difference. First operand 61787 states and 91399 transitions. Second operand 3 states. [2019-09-08 10:03:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:37,648 INFO L93 Difference]: Finished difference Result 181338 states and 267633 transitions. [2019-09-08 10:03:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:37,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 10:03:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:37,771 INFO L225 Difference]: With dead ends: 181338 [2019-09-08 10:03:37,771 INFO L226 Difference]: Without dead ends: 120898 [2019-09-08 10:03:37,836 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 10:03:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120898 states. [2019-09-08 10:03:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120898 to 120770. [2019-09-08 10:03:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120770 states. [2019-09-08 10:03:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120770 states to 120770 states and 177278 transitions. [2019-09-08 10:03:46,648 INFO L78 Accepts]: Start accepts. Automaton has 120770 states and 177278 transitions. Word has length 318 [2019-09-08 10:03:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:46,648 INFO L475 AbstractCegarLoop]: Abstraction has 120770 states and 177278 transitions. [2019-09-08 10:03:46,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 120770 states and 177278 transitions. [2019-09-08 10:03:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 10:03:46,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:46,730 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:46,730 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1508526010, now seen corresponding path program 1 times [2019-09-08 10:03:46,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:46,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:47,022 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 10:03:47,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:47,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:47,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:47,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:47,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:47,026 INFO L87 Difference]: Start difference. First operand 120770 states and 177278 transitions. Second operand 4 states. [2019-09-08 10:04:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:00,498 INFO L93 Difference]: Finished difference Result 323395 states and 473142 transitions. [2019-09-08 10:04:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:04:00,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 10:04:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:00,725 INFO L225 Difference]: With dead ends: 323395 [2019-09-08 10:04:00,725 INFO L226 Difference]: Without dead ends: 205917 [2019-09-08 10:04:01,126 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 10:04:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205917 states. [2019-09-08 10:04:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205917 to 117903. [2019-09-08 10:04:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117903 states. [2019-09-08 10:04:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117903 states to 117903 states and 173023 transitions. [2019-09-08 10:04:12,322 INFO L78 Accepts]: Start accepts. Automaton has 117903 states and 173023 transitions. Word has length 318 [2019-09-08 10:04:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:12,322 INFO L475 AbstractCegarLoop]: Abstraction has 117903 states and 173023 transitions. [2019-09-08 10:04:12,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 117903 states and 173023 transitions. [2019-09-08 10:04:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 10:04:12,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:12,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:12,396 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -168370870, now seen corresponding path program 1 times [2019-09-08 10:04:12,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:12,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:12,549 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 10:04:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:12,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:12,552 INFO L87 Difference]: Start difference. First operand 117903 states and 173023 transitions. Second operand 3 states. [2019-09-08 10:04:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:28,155 INFO L93 Difference]: Finished difference Result 317688 states and 464960 transitions. [2019-09-08 10:04:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:28,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 10:04:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:28,377 INFO L225 Difference]: With dead ends: 317688 [2019-09-08 10:04:28,377 INFO L226 Difference]: Without dead ends: 207810 [2019-09-08 10:04:28,459 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 10:04:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207810 states. [2019-09-08 10:04:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207810 to 118384. [2019-09-08 10:04:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118384 states. [2019-09-08 10:04:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118384 states to 118384 states and 173621 transitions. [2019-09-08 10:04:37,003 INFO L78 Accepts]: Start accepts. Automaton has 118384 states and 173621 transitions. Word has length 321 [2019-09-08 10:04:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:37,004 INFO L475 AbstractCegarLoop]: Abstraction has 118384 states and 173621 transitions. [2019-09-08 10:04:37,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 118384 states and 173621 transitions. [2019-09-08 10:04:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 10:04:37,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:37,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:37,084 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 436074777, now seen corresponding path program 1 times [2019-09-08 10:04:37,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:37,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:37,391 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 10:04:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:37,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:37,394 INFO L87 Difference]: Start difference. First operand 118384 states and 173621 transitions. Second operand 4 states. [2019-09-08 10:04:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:46,048 INFO L93 Difference]: Finished difference Result 219012 states and 320457 transitions. [2019-09-08 10:04:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:04:46,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 10:04:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:46,152 INFO L225 Difference]: With dead ends: 219012 [2019-09-08 10:04:46,152 INFO L226 Difference]: Without dead ends: 105940 [2019-09-08 10:04:46,207 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 10:04:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105940 states. [2019-09-08 10:04:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105940 to 105613. [2019-09-08 10:04:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105613 states. [2019-09-08 10:04:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105613 states to 105613 states and 154775 transitions. [2019-09-08 10:04:56,004 INFO L78 Accepts]: Start accepts. Automaton has 105613 states and 154775 transitions. Word has length 322 [2019-09-08 10:04:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:56,005 INFO L475 AbstractCegarLoop]: Abstraction has 105613 states and 154775 transitions. [2019-09-08 10:04:56,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 105613 states and 154775 transitions. [2019-09-08 10:04:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 10:04:56,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:56,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:56,078 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1412998321, now seen corresponding path program 1 times [2019-09-08 10:04:56,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:56,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:56,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:56,224 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 10:04:56,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:56,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:56,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:56,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:56,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:56,226 INFO L87 Difference]: Start difference. First operand 105613 states and 154775 transitions. Second operand 3 states. [2019-09-08 10:05:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:09,928 INFO L93 Difference]: Finished difference Result 279102 states and 409071 transitions. [2019-09-08 10:05:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:09,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 10:05:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:10,129 INFO L225 Difference]: With dead ends: 279102 [2019-09-08 10:05:10,129 INFO L226 Difference]: Without dead ends: 185346 [2019-09-08 10:05:10,205 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 10:05:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185346 states. [2019-09-08 10:05:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185346 to 185164. [2019-09-08 10:05:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185164 states. [2019-09-08 10:05:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185164 states to 185164 states and 270001 transitions. [2019-09-08 10:05:27,473 INFO L78 Accepts]: Start accepts. Automaton has 185164 states and 270001 transitions. Word has length 326 [2019-09-08 10:05:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:27,474 INFO L475 AbstractCegarLoop]: Abstraction has 185164 states and 270001 transitions. [2019-09-08 10:05:27,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 185164 states and 270001 transitions. [2019-09-08 10:05:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 10:05:27,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:27,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:05:27,612 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash 682019360, now seen corresponding path program 1 times [2019-09-08 10:05:27,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:28,026 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 10:05:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:05:28,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:05:28,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:05:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:05:28,028 INFO L87 Difference]: Start difference. First operand 185164 states and 270001 transitions. Second operand 8 states. [2019-09-08 10:05:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:53,250 INFO L93 Difference]: Finished difference Result 361134 states and 530233 transitions. [2019-09-08 10:05:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:53,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 326 [2019-09-08 10:05:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:53,565 INFO L225 Difference]: With dead ends: 361134 [2019-09-08 10:05:53,566 INFO L226 Difference]: Without dead ends: 315176 [2019-09-08 10:05:53,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:05:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315176 states. [2019-09-08 10:06:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315176 to 315174. [2019-09-08 10:06:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315174 states. [2019-09-08 10:06:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315174 states to 315174 states and 453889 transitions. [2019-09-08 10:06:23,511 INFO L78 Accepts]: Start accepts. Automaton has 315174 states and 453889 transitions. Word has length 326 [2019-09-08 10:06:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:23,511 INFO L475 AbstractCegarLoop]: Abstraction has 315174 states and 453889 transitions. [2019-09-08 10:06:23,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:06:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 315174 states and 453889 transitions. [2019-09-08 10:06:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 10:06:23,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:23,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:06:23,744 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash -725135157, now seen corresponding path program 1 times [2019-09-08 10:06:23,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:24,652 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 10:06:24,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:24,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:06:24,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:06:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:06:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:06:24,654 INFO L87 Difference]: Start difference. First operand 315174 states and 453889 transitions. Second operand 4 states. [2019-09-08 10:07:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:18,336 INFO L93 Difference]: Finished difference Result 898968 states and 1293037 transitions. [2019-09-08 10:07:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:18,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 10:07:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:19,050 INFO L225 Difference]: With dead ends: 898968 [2019-09-08 10:07:19,050 INFO L226 Difference]: Without dead ends: 584012 [2019-09-08 10:07:19,263 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 10:07:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584012 states. [2019-09-08 10:08:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584012 to 583912. [2019-09-08 10:08:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583912 states. [2019-09-08 10:08:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583912 states to 583912 states and 834051 transitions. [2019-09-08 10:08:22,750 INFO L78 Accepts]: Start accepts. Automaton has 583912 states and 834051 transitions. Word has length 326 [2019-09-08 10:08:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:22,750 INFO L475 AbstractCegarLoop]: Abstraction has 583912 states and 834051 transitions. [2019-09-08 10:08:22,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:08:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 583912 states and 834051 transitions. [2019-09-08 10:08:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 10:08:23,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:23,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:23,233 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 937142803, now seen corresponding path program 1 times [2019-09-08 10:08:23,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:23,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:23,463 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 10:08:23,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:23,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:23,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:23,465 INFO L87 Difference]: Start difference. First operand 583912 states and 834051 transitions. Second operand 3 states. [2019-09-08 10:10:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:11,291 INFO L93 Difference]: Finished difference Result 1721016 states and 2452158 transitions. [2019-09-08 10:10:11,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:10:11,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 10:10:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:13,593 INFO L225 Difference]: With dead ends: 1721016 [2019-09-08 10:10:13,593 INFO L226 Difference]: Without dead ends: 1141781 [2019-09-08 10:10:14,057 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 10:10:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141781 states. [2019-09-08 10:12:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141781 to 1141445. [2019-09-08 10:12:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141445 states. [2019-09-08 10:12:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141445 states to 1141445 states and 1614871 transitions. [2019-09-08 10:12:32,669 INFO L78 Accepts]: Start accepts. Automaton has 1141445 states and 1614871 transitions. Word has length 328 [2019-09-08 10:12:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:32,669 INFO L475 AbstractCegarLoop]: Abstraction has 1141445 states and 1614871 transitions. [2019-09-08 10:12:32,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1141445 states and 1614871 transitions. [2019-09-08 10:12:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 10:12:35,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:35,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:12:35,249 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1051888174, now seen corresponding path program 1 times [2019-09-08 10:12:35,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:35,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:35,460 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 10:12:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:35,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:35,462 INFO L87 Difference]: Start difference. First operand 1141445 states and 1614871 transitions. Second operand 3 states.