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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:51:49,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:51:49,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:51:49,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:51:49,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:51:49,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:51:49,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:51:49,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:51:49,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:51:49,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:51:49,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:51:49,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:51:49,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:51:49,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:51:49,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:51:49,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:51:49,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:51:49,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:51:49,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:51:49,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:51:49,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:51:49,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:51:49,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:51:49,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:51:49,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:51:49,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:51:49,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:51:49,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:51:49,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:51:49,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:51:49,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:51:49,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:51:49,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:51:49,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:51:49,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:51:49,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:51:49,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:51:49,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:51:49,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:51:49,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:51:49,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:51:49,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:51:49,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:51:49,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:51:49,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:51:49,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:51:49,954 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:51:49,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:51:49,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:51:49,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:51:49,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:51:49,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:51:49,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:51:49,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:51:49,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:51:49,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:51:49,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:51:49,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:51:49,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:51:49,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:51:49,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:51:49,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:51:49,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:51:49,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:51:49,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:51:49,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:51:49,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:51:49,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:51:49,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:51:49,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:51:49,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:51:49,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:51:50,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:51:50,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:51:50,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:51:50,006 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:51:50,007 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:51:50,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef27d066/c50f1540b2b3493da4ca81d01b867002/FLAG0e4de0a71 [2019-09-08 09:51:50,797 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:51:50,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:51:50,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef27d066/c50f1540b2b3493da4ca81d01b867002/FLAG0e4de0a71 [2019-09-08 09:51:50,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef27d066/c50f1540b2b3493da4ca81d01b867002 [2019-09-08 09:51:50,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:51:50,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:51:50,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:50,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:51:50,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:51:50,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:50" (1/1) ... [2019-09-08 09:51:50,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625ecc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:50, skipping insertion in model container [2019-09-08 09:51:50,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:50" (1/1) ... [2019-09-08 09:51:51,001 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:51:51,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:51:52,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:52,636 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:51:53,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:53,422 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:51:53,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53 WrapperNode [2019-09-08 09:51:53,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:53,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:51:53,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:51:53,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:51:53,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... [2019-09-08 09:51:53,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:51:53,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:51:53,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:51:53,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:51:53,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:51:53,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:51:53,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:51:53,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:51:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:51:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:51:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:51:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:51:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:51:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:51:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:51:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:51:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:51:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:51:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:51:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:51:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:51:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:51:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:51:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:51:56,621 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:51:56,621 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:51:56,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:56 BoogieIcfgContainer [2019-09-08 09:51:56,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:51:56,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:51:56,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:51:56,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:51:56,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:51:50" (1/3) ... [2019-09-08 09:51:56,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41334a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:56, skipping insertion in model container [2019-09-08 09:51:56,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:53" (2/3) ... [2019-09-08 09:51:56,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41334a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:56, skipping insertion in model container [2019-09-08 09:51:56,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:56" (3/3) ... [2019-09-08 09:51:56,632 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:51:56,643 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:51:56,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:51:56,671 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:51:56,712 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:51:56,713 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:51:56,713 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:51:56,714 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:51:56,714 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:51:56,714 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:51:56,714 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:51:56,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:51:56,714 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:51:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states. [2019-09-08 09:51:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:51:56,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:56,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:56,781 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -793306270, now seen corresponding path program 1 times [2019-09-08 09:51:56,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:57,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:57,736 INFO L87 Difference]: Start difference. First operand 910 states. Second operand 3 states. [2019-09-08 09:51:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:58,103 INFO L93 Difference]: Finished difference Result 1544 states and 2751 transitions. [2019-09-08 09:51:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:58,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:51:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:58,134 INFO L225 Difference]: With dead ends: 1544 [2019-09-08 09:51:58,134 INFO L226 Difference]: Without dead ends: 1300 [2019-09-08 09:51:58,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-09-08 09:51:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1298. [2019-09-08 09:51:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-09-08 09:51:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1986 transitions. [2019-09-08 09:51:58,256 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1986 transitions. Word has length 302 [2019-09-08 09:51:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:58,257 INFO L475 AbstractCegarLoop]: Abstraction has 1298 states and 1986 transitions. [2019-09-08 09:51:58,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1986 transitions. [2019-09-08 09:51:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:51:58,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:58,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:58,264 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1622135027, now seen corresponding path program 1 times [2019-09-08 09:51:58,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:58,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:51:58,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:58,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:58,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:58,675 INFO L87 Difference]: Start difference. First operand 1298 states and 1986 transitions. Second operand 3 states. [2019-09-08 09:51:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:59,043 INFO L93 Difference]: Finished difference Result 2479 states and 3842 transitions. [2019-09-08 09:51:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:59,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:51:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:59,058 INFO L225 Difference]: With dead ends: 2479 [2019-09-08 09:51:59,058 INFO L226 Difference]: Without dead ends: 2162 [2019-09-08 09:51:59,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2019-09-08 09:51:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2160. [2019-09-08 09:51:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-09-08 09:51:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 3328 transitions. [2019-09-08 09:51:59,152 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 3328 transitions. Word has length 302 [2019-09-08 09:51:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:59,154 INFO L475 AbstractCegarLoop]: Abstraction has 2160 states and 3328 transitions. [2019-09-08 09:51:59,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 3328 transitions. [2019-09-08 09:51:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:51:59,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:59,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:59,163 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1621796403, now seen corresponding path program 1 times [2019-09-08 09:51:59,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:00,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:00,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:00,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:00,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:00,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:00,123 INFO L87 Difference]: Start difference. First operand 2160 states and 3328 transitions. Second operand 4 states. [2019-09-08 09:52:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:00,453 INFO L93 Difference]: Finished difference Result 6386 states and 9835 transitions. [2019-09-08 09:52:00,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:00,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 09:52:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:00,484 INFO L225 Difference]: With dead ends: 6386 [2019-09-08 09:52:00,484 INFO L226 Difference]: Without dead ends: 4241 [2019-09-08 09:52:00,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2019-09-08 09:52:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 4099. [2019-09-08 09:52:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2019-09-08 09:52:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 6301 transitions. [2019-09-08 09:52:00,709 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 6301 transitions. Word has length 302 [2019-09-08 09:52:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:00,710 INFO L475 AbstractCegarLoop]: Abstraction has 4099 states and 6301 transitions. [2019-09-08 09:52:00,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 6301 transitions. [2019-09-08 09:52:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:52:00,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:00,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:00,721 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 293737729, now seen corresponding path program 1 times [2019-09-08 09:52:00,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:00,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:01,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:01,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:01,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:01,020 INFO L87 Difference]: Start difference. First operand 4099 states and 6301 transitions. Second operand 3 states. [2019-09-08 09:52:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:01,380 INFO L93 Difference]: Finished difference Result 12022 states and 18443 transitions. [2019-09-08 09:52:01,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:01,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:52:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:01,418 INFO L225 Difference]: With dead ends: 12022 [2019-09-08 09:52:01,418 INFO L226 Difference]: Without dead ends: 8052 [2019-09-08 09:52:01,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8052 states. [2019-09-08 09:52:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8052 to 7910. [2019-09-08 09:52:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2019-09-08 09:52:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 12114 transitions. [2019-09-08 09:52:01,799 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 12114 transitions. Word has length 304 [2019-09-08 09:52:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:01,800 INFO L475 AbstractCegarLoop]: Abstraction has 7910 states and 12114 transitions. [2019-09-08 09:52:01,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 12114 transitions. [2019-09-08 09:52:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:52:01,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:01,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:01,819 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash -380251578, now seen corresponding path program 1 times [2019-09-08 09:52:01,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:01,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:01,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:01,981 INFO L87 Difference]: Start difference. First operand 7910 states and 12114 transitions. Second operand 3 states. [2019-09-08 09:52:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:02,517 INFO L93 Difference]: Finished difference Result 23655 states and 36218 transitions. [2019-09-08 09:52:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:02,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:52:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:02,579 INFO L225 Difference]: With dead ends: 23655 [2019-09-08 09:52:02,579 INFO L226 Difference]: Without dead ends: 15787 [2019-09-08 09:52:02,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15787 states. [2019-09-08 09:52:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15787 to 7929. [2019-09-08 09:52:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7929 states. [2019-09-08 09:52:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7929 states to 7929 states and 12142 transitions. [2019-09-08 09:52:03,040 INFO L78 Accepts]: Start accepts. Automaton has 7929 states and 12142 transitions. Word has length 304 [2019-09-08 09:52:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:03,041 INFO L475 AbstractCegarLoop]: Abstraction has 7929 states and 12142 transitions. [2019-09-08 09:52:03,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7929 states and 12142 transitions. [2019-09-08 09:52:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 09:52:03,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:03,057 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 09:52:03,058 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1967466857, now seen corresponding path program 1 times [2019-09-08 09:52:03,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:03,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:03,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:03,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:03,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:03,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:03,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:03,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:03,249 INFO L87 Difference]: Start difference. First operand 7929 states and 12142 transitions. Second operand 3 states. [2019-09-08 09:52:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:03,717 INFO L93 Difference]: Finished difference Result 23674 states and 36239 transitions. [2019-09-08 09:52:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:03,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 09:52:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:03,755 INFO L225 Difference]: With dead ends: 23674 [2019-09-08 09:52:03,755 INFO L226 Difference]: Without dead ends: 15805 [2019-09-08 09:52:03,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15805 states. [2019-09-08 09:52:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15805 to 7947. [2019-09-08 09:52:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7947 states. [2019-09-08 09:52:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7947 states to 7947 states and 12163 transitions. [2019-09-08 09:52:04,198 INFO L78 Accepts]: Start accepts. Automaton has 7947 states and 12163 transitions. Word has length 305 [2019-09-08 09:52:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:04,198 INFO L475 AbstractCegarLoop]: Abstraction has 7947 states and 12163 transitions. [2019-09-08 09:52:04,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 12163 transitions. [2019-09-08 09:52:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:52:04,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:04,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:04,218 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:04,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1319362460, now seen corresponding path program 1 times [2019-09-08 09:52:04,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:04,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:04,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:04,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:04,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:04,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:04,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:04,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:04,596 INFO L87 Difference]: Start difference. First operand 7947 states and 12163 transitions. Second operand 3 states. [2019-09-08 09:52:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:05,149 INFO L93 Difference]: Finished difference Result 23214 states and 35450 transitions. [2019-09-08 09:52:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:05,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:52:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:05,188 INFO L225 Difference]: With dead ends: 23214 [2019-09-08 09:52:05,189 INFO L226 Difference]: Without dead ends: 15512 [2019-09-08 09:52:05,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15512 states. [2019-09-08 09:52:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15512 to 15370. [2019-09-08 09:52:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15370 states. [2019-09-08 09:52:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15370 states to 15370 states and 23391 transitions. [2019-09-08 09:52:05,921 INFO L78 Accepts]: Start accepts. Automaton has 15370 states and 23391 transitions. Word has length 306 [2019-09-08 09:52:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:05,921 INFO L475 AbstractCegarLoop]: Abstraction has 15370 states and 23391 transitions. [2019-09-08 09:52:05,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15370 states and 23391 transitions. [2019-09-08 09:52:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:52:05,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:05,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:05,952 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 183505465, now seen corresponding path program 1 times [2019-09-08 09:52:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:05,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:05,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:06,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:06,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:06,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:06,325 INFO L87 Difference]: Start difference. First operand 15370 states and 23391 transitions. Second operand 4 states. [2019-09-08 09:52:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:08,254 INFO L93 Difference]: Finished difference Result 43458 states and 65923 transitions. [2019-09-08 09:52:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:08,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:52:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:08,323 INFO L225 Difference]: With dead ends: 43458 [2019-09-08 09:52:08,324 INFO L226 Difference]: Without dead ends: 28628 [2019-09-08 09:52:08,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28628 states. [2019-09-08 09:52:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28628 to 15605. [2019-09-08 09:52:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-09-08 09:52:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 23779 transitions. [2019-09-08 09:52:09,262 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 23779 transitions. Word has length 306 [2019-09-08 09:52:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:09,262 INFO L475 AbstractCegarLoop]: Abstraction has 15605 states and 23779 transitions. [2019-09-08 09:52:09,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 23779 transitions. [2019-09-08 09:52:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:52:09,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:09,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:09,289 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1255917736, now seen corresponding path program 1 times [2019-09-08 09:52:09,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:09,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:09,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:09,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:09,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:09,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:09,430 INFO L87 Difference]: Start difference. First operand 15605 states and 23779 transitions. Second operand 3 states. [2019-09-08 09:52:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:10,399 INFO L93 Difference]: Finished difference Result 45245 states and 68618 transitions. [2019-09-08 09:52:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:10,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:52:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:10,456 INFO L225 Difference]: With dead ends: 45245 [2019-09-08 09:52:10,456 INFO L226 Difference]: Without dead ends: 30443 [2019-09-08 09:52:10,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30443 states. [2019-09-08 09:52:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30443 to 15709. [2019-09-08 09:52:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15709 states. [2019-09-08 09:52:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 23922 transitions. [2019-09-08 09:52:11,155 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 23922 transitions. Word has length 308 [2019-09-08 09:52:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:11,155 INFO L475 AbstractCegarLoop]: Abstraction has 15709 states and 23922 transitions. [2019-09-08 09:52:11,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 23922 transitions. [2019-09-08 09:52:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 09:52:11,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:11,186 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 09:52:11,187 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1180134737, now seen corresponding path program 1 times [2019-09-08 09:52:11,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:11,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:11,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:11,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:11,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:11,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:11,332 INFO L87 Difference]: Start difference. First operand 15709 states and 23922 transitions. Second operand 3 states. [2019-09-08 09:52:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:12,349 INFO L93 Difference]: Finished difference Result 45377 states and 68784 transitions. [2019-09-08 09:52:12,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:12,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-08 09:52:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:12,395 INFO L225 Difference]: With dead ends: 45377 [2019-09-08 09:52:12,395 INFO L226 Difference]: Without dead ends: 30568 [2019-09-08 09:52:12,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30568 states. [2019-09-08 09:52:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30568 to 15834. [2019-09-08 09:52:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15834 states. [2019-09-08 09:52:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15834 states to 15834 states and 24068 transitions. [2019-09-08 09:52:13,946 INFO L78 Accepts]: Start accepts. Automaton has 15834 states and 24068 transitions. Word has length 309 [2019-09-08 09:52:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:13,946 INFO L475 AbstractCegarLoop]: Abstraction has 15834 states and 24068 transitions. [2019-09-08 09:52:13,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 15834 states and 24068 transitions. [2019-09-08 09:52:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:52:13,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:13,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:13,967 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:13,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1030476261, now seen corresponding path program 1 times [2019-09-08 09:52:13,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:13,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:13,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:13,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:14,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:14,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:14,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:14,312 INFO L87 Difference]: Start difference. First operand 15834 states and 24068 transitions. Second operand 4 states. [2019-09-08 09:52:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:14,819 INFO L93 Difference]: Finished difference Result 28942 states and 43852 transitions. [2019-09-08 09:52:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:14,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-08 09:52:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:14,844 INFO L225 Difference]: With dead ends: 28942 [2019-09-08 09:52:14,844 INFO L226 Difference]: Without dead ends: 13971 [2019-09-08 09:52:14,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13971 states. [2019-09-08 09:52:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13971 to 13951. [2019-09-08 09:52:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13951 states. [2019-09-08 09:52:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13951 states to 13951 states and 21201 transitions. [2019-09-08 09:52:15,566 INFO L78 Accepts]: Start accepts. Automaton has 13951 states and 21201 transitions. Word has length 310 [2019-09-08 09:52:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:15,566 INFO L475 AbstractCegarLoop]: Abstraction has 13951 states and 21201 transitions. [2019-09-08 09:52:15,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13951 states and 21201 transitions. [2019-09-08 09:52:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:52:15,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:15,576 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 09:52:15,577 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash -293944310, now seen corresponding path program 1 times [2019-09-08 09:52:15,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:15,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:15,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:52:16,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:52:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:52:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:52:16,136 INFO L87 Difference]: Start difference. First operand 13951 states and 21201 transitions. Second operand 9 states. [2019-09-08 09:52:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:17,715 INFO L93 Difference]: Finished difference Result 27948 states and 42937 transitions. [2019-09-08 09:52:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:17,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-08 09:52:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:17,750 INFO L225 Difference]: With dead ends: 27948 [2019-09-08 09:52:17,750 INFO L226 Difference]: Without dead ends: 24167 [2019-09-08 09:52:17,764 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 09:52:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24167 states. [2019-09-08 09:52:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24167 to 24165. [2019-09-08 09:52:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24165 states. [2019-09-08 09:52:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24165 states to 24165 states and 36549 transitions. [2019-09-08 09:52:18,937 INFO L78 Accepts]: Start accepts. Automaton has 24165 states and 36549 transitions. Word has length 314 [2019-09-08 09:52:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:18,937 INFO L475 AbstractCegarLoop]: Abstraction has 24165 states and 36549 transitions. [2019-09-08 09:52:18,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:52:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 24165 states and 36549 transitions. [2019-09-08 09:52:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:52:18,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:18,952 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 09:52:18,953 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 451007038, now seen corresponding path program 1 times [2019-09-08 09:52:18,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:18,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:18,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:20,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:20,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:52:20,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:52:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:52:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:52:20,156 INFO L87 Difference]: Start difference. First operand 24165 states and 36549 transitions. Second operand 17 states. [2019-09-08 09:52:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:26,557 INFO L93 Difference]: Finished difference Result 43210 states and 66203 transitions. [2019-09-08 09:52:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:52:26,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 314 [2019-09-08 09:52:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:26,591 INFO L225 Difference]: With dead ends: 43210 [2019-09-08 09:52:26,591 INFO L226 Difference]: Without dead ends: 40622 [2019-09-08 09:52:26,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:52:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40622 states. [2019-09-08 09:52:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40622 to 26521. [2019-09-08 09:52:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26521 states. [2019-09-08 09:52:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26521 states to 26521 states and 39893 transitions. [2019-09-08 09:52:27,846 INFO L78 Accepts]: Start accepts. Automaton has 26521 states and 39893 transitions. Word has length 314 [2019-09-08 09:52:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:27,847 INFO L475 AbstractCegarLoop]: Abstraction has 26521 states and 39893 transitions. [2019-09-08 09:52:27,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:52:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26521 states and 39893 transitions. [2019-09-08 09:52:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:52:27,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:27,871 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 09:52:27,871 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -126096328, now seen corresponding path program 1 times [2019-09-08 09:52:27,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:27,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:27,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:27,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:27,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:28,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:28,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:28,511 INFO L87 Difference]: Start difference. First operand 26521 states and 39893 transitions. Second operand 4 states. [2019-09-08 09:52:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:31,424 INFO L93 Difference]: Finished difference Result 78205 states and 117488 transitions. [2019-09-08 09:52:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:31,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:52:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:31,473 INFO L225 Difference]: With dead ends: 78205 [2019-09-08 09:52:31,473 INFO L226 Difference]: Without dead ends: 51756 [2019-09-08 09:52:31,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:52:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51756 states. [2019-09-08 09:52:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51756 to 51620. [2019-09-08 09:52:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51620 states. [2019-09-08 09:52:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51620 states to 51620 states and 77085 transitions. [2019-09-08 09:52:35,168 INFO L78 Accepts]: Start accepts. Automaton has 51620 states and 77085 transitions. Word has length 314 [2019-09-08 09:52:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:35,168 INFO L475 AbstractCegarLoop]: Abstraction has 51620 states and 77085 transitions. [2019-09-08 09:52:35,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 51620 states and 77085 transitions. [2019-09-08 09:52:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:52:35,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:35,214 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 09:52:35,214 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1746697347, now seen corresponding path program 1 times [2019-09-08 09:52:35,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:35,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:35,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:35,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:35,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:35,430 INFO L87 Difference]: Start difference. First operand 51620 states and 77085 transitions. Second operand 3 states. [2019-09-08 09:52:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:40,637 INFO L93 Difference]: Finished difference Result 151090 states and 225035 transitions. [2019-09-08 09:52:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:40,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 09:52:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:40,761 INFO L225 Difference]: With dead ends: 151090 [2019-09-08 09:52:40,761 INFO L226 Difference]: Without dead ends: 100719 [2019-09-08 09:52:40,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100719 states. [2019-09-08 09:52:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100719 to 100587. [2019-09-08 09:52:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100587 states. [2019-09-08 09:52:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100587 states to 100587 states and 149059 transitions. [2019-09-08 09:52:47,772 INFO L78 Accepts]: Start accepts. Automaton has 100587 states and 149059 transitions. Word has length 316 [2019-09-08 09:52:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 100587 states and 149059 transitions. [2019-09-08 09:52:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 100587 states and 149059 transitions. [2019-09-08 09:52:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 09:52:47,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:47,839 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 09:52:47,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -694608418, now seen corresponding path program 1 times [2019-09-08 09:52:47,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:52:48,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:48,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:48,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:48,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:48,066 INFO L87 Difference]: Start difference. First operand 100587 states and 149059 transitions. Second operand 3 states. [2019-09-08 09:52:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:59,680 INFO L93 Difference]: Finished difference Result 296114 states and 438037 transitions. [2019-09-08 09:52:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:59,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 09:52:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:59,892 INFO L225 Difference]: With dead ends: 296114 [2019-09-08 09:52:59,892 INFO L226 Difference]: Without dead ends: 196874 [2019-09-08 09:52:59,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196874 states. [2019-09-08 09:53:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196874 to 196746. [2019-09-08 09:53:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196746 states. [2019-09-08 09:53:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196746 states to 196746 states and 289406 transitions. [2019-09-08 09:53:14,158 INFO L78 Accepts]: Start accepts. Automaton has 196746 states and 289406 transitions. Word has length 318 [2019-09-08 09:53:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:14,158 INFO L475 AbstractCegarLoop]: Abstraction has 196746 states and 289406 transitions. [2019-09-08 09:53:14,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 196746 states and 289406 transitions. [2019-09-08 09:53:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 09:53:14,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:14,305 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 09:53:14,306 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1626312645, now seen corresponding path program 1 times [2019-09-08 09:53:14,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:14,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:53:15,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:15,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:53:15,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:53:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:53:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:53:15,026 INFO L87 Difference]: Start difference. First operand 196746 states and 289406 transitions. Second operand 4 states. [2019-09-08 09:53:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:36,905 INFO L93 Difference]: Finished difference Result 528077 states and 774942 transitions. [2019-09-08 09:53:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:53:36,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 09:53:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:37,287 INFO L225 Difference]: With dead ends: 528077 [2019-09-08 09:53:37,288 INFO L226 Difference]: Without dead ends: 334623 [2019-09-08 09:53:37,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:53:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334623 states. [2019-09-08 09:53:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334623 to 191379. [2019-09-08 09:53:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191379 states. [2019-09-08 09:53:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191379 states to 191379 states and 281411 transitions. [2019-09-08 09:53:55,903 INFO L78 Accepts]: Start accepts. Automaton has 191379 states and 281411 transitions. Word has length 318 [2019-09-08 09:53:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:55,904 INFO L475 AbstractCegarLoop]: Abstraction has 191379 states and 281411 transitions. [2019-09-08 09:53:55,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:53:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 191379 states and 281411 transitions. [2019-09-08 09:53:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 09:53:56,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:56,039 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 09:53:56,039 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash 991757771, now seen corresponding path program 1 times [2019-09-08 09:53:56,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:53:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:56,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:56,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:56,188 INFO L87 Difference]: Start difference. First operand 191379 states and 281411 transitions. Second operand 3 states. [2019-09-08 09:54:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:19,897 INFO L93 Difference]: Finished difference Result 521024 states and 764741 transitions. [2019-09-08 09:54:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:19,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 09:54:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:20,258 INFO L225 Difference]: With dead ends: 521024 [2019-09-08 09:54:20,258 INFO L226 Difference]: Without dead ends: 340286 [2019-09-08 09:54:20,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340286 states. [2019-09-08 09:54:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340286 to 191860. [2019-09-08 09:54:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191860 states. [2019-09-08 09:54:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191860 states to 191860 states and 282009 transitions. [2019-09-08 09:54:40,148 INFO L78 Accepts]: Start accepts. Automaton has 191860 states and 282009 transitions. Word has length 321 [2019-09-08 09:54:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:40,149 INFO L475 AbstractCegarLoop]: Abstraction has 191860 states and 282009 transitions. [2019-09-08 09:54:40,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 191860 states and 282009 transitions. [2019-09-08 09:54:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:54:40,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:40,270 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 09:54:40,270 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1596203418, now seen corresponding path program 1 times [2019-09-08 09:54:40,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:40,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:40,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:40,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:40,540 INFO L87 Difference]: Start difference. First operand 191860 states and 282009 transitions. Second operand 4 states. [2019-09-08 09:54:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:54,203 INFO L93 Difference]: Finished difference Result 358297 states and 525787 transitions. [2019-09-08 09:54:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:54,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 09:54:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:54,381 INFO L225 Difference]: With dead ends: 358297 [2019-09-08 09:54:54,381 INFO L226 Difference]: Without dead ends: 171749 [2019-09-08 09:54:54,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171749 states. [2019-09-08 09:55:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171749 to 171422. [2019-09-08 09:55:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171422 states. [2019-09-08 09:55:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171422 states to 171422 states and 251717 transitions. [2019-09-08 09:55:07,678 INFO L78 Accepts]: Start accepts. Automaton has 171422 states and 251717 transitions. Word has length 322 [2019-09-08 09:55:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:07,678 INFO L475 AbstractCegarLoop]: Abstraction has 171422 states and 251717 transitions. [2019-09-08 09:55:07,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 171422 states and 251717 transitions. [2019-09-08 09:55:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:55:07,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:07,792 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1412198775, now seen corresponding path program 1 times [2019-09-08 09:55:07,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:07,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:07,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:07,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:07,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:07,959 INFO L87 Difference]: Start difference. First operand 171422 states and 251717 transitions. Second operand 3 states. [2019-09-08 09:55:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:30,916 INFO L93 Difference]: Finished difference Result 465223 states and 683661 transitions. [2019-09-08 09:55:30,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:30,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 09:55:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:31,253 INFO L225 Difference]: With dead ends: 465223 [2019-09-08 09:55:31,253 INFO L226 Difference]: Without dead ends: 308891 [2019-09-08 09:55:31,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308891 states. [2019-09-08 09:55:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308891 to 308709. [2019-09-08 09:55:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308709 states. [2019-09-08 09:55:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308709 states to 308709 states and 451015 transitions. [2019-09-08 09:55:59,174 INFO L78 Accepts]: Start accepts. Automaton has 308709 states and 451015 transitions. Word has length 326 [2019-09-08 09:55:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:59,175 INFO L475 AbstractCegarLoop]: Abstraction has 308709 states and 451015 transitions. [2019-09-08 09:55:59,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 308709 states and 451015 transitions. [2019-09-08 09:55:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:55:59,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:59,937 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 09:55:59,937 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 682818906, now seen corresponding path program 1 times [2019-09-08 09:55:59,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:59,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:00,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:00,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:56:00,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:56:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:56:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:56:00,298 INFO L87 Difference]: Start difference. First operand 308709 states and 451015 transitions. Second operand 8 states. [2019-09-08 09:56:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:41,447 INFO L93 Difference]: Finished difference Result 628711 states and 925785 transitions. [2019-09-08 09:56:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:41,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 326 [2019-09-08 09:56:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:42,061 INFO L225 Difference]: With dead ends: 628711 [2019-09-08 09:56:42,061 INFO L226 Difference]: Without dead ends: 539665 [2019-09-08 09:56:42,204 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 09:56:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539665 states. [2019-09-08 09:57:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539665 to 539663. [2019-09-08 09:57:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539663 states. [2019-09-08 09:57:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539663 states to 539663 states and 778593 transitions. [2019-09-08 09:57:37,165 INFO L78 Accepts]: Start accepts. Automaton has 539663 states and 778593 transitions. Word has length 326 [2019-09-08 09:57:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:37,166 INFO L475 AbstractCegarLoop]: Abstraction has 539663 states and 778593 transitions. [2019-09-08 09:57:37,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:57:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 539663 states and 778593 transitions. [2019-09-08 09:57:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:57:37,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:37,631 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 09:57:37,632 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1917966747, now seen corresponding path program 1 times [2019-09-08 09:57:37,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:37,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:38,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:38,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:57:38,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:57:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:57:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:57:38,855 INFO L87 Difference]: Start difference. First operand 539663 states and 778593 transitions. Second operand 4 states. [2019-09-08 09:59:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:09,031 INFO L93 Difference]: Finished difference Result 1537540 states and 2216341 transitions. [2019-09-08 09:59:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:09,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 09:59:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:10,323 INFO L225 Difference]: With dead ends: 1537540 [2019-09-08 09:59:10,323 INFO L226 Difference]: Without dead ends: 998095 [2019-09-08 09:59:10,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:59:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998095 states. [2019-09-08 10:00:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998095 to 997995. [2019-09-08 10:00:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997995 states. [2019-09-08 10:00:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997995 states to 997995 states and 1429067 transitions. [2019-09-08 10:00:58,029 INFO L78 Accepts]: Start accepts. Automaton has 997995 states and 1429067 transitions. Word has length 326 [2019-09-08 10:00:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:58,029 INFO L475 AbstractCegarLoop]: Abstraction has 997995 states and 1429067 transitions. [2019-09-08 10:00:58,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:00:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 997995 states and 1429067 transitions. [2019-09-08 10:00:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 10:00:58,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:58,939 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:00:58,940 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash -255688787, now seen corresponding path program 1 times [2019-09-08 10:00:58,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:58,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:58,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:59,126 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:00:59,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:59,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:59,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:59,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:59,128 INFO L87 Difference]: Start difference. First operand 997995 states and 1429067 transitions. Second operand 3 states.