java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:43:23,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:43:23,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:43:23,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:43:23,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:43:23,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:43:23,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:43:23,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:43:23,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:43:23,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:43:23,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:43:23,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:43:23,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:43:23,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:43:23,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:43:23,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:43:23,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:43:23,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:43:23,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:43:23,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:43:23,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:43:23,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:43:23,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:43:23,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:43:23,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:43:23,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:43:23,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:43:23,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:43:23,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:43:23,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:43:23,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:43:23,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:43:23,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:43:23,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:43:23,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:43:23,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:43:23,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:43:23,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:43:23,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:43:23,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:43:23,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:43:23,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:43:23,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:43:23,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:43:23,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:43:23,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:43:23,966 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:43:23,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:43:23,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:43:23,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:43:23,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:43:23,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:43:23,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:43:23,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:43:23,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:43:23,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:43:23,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:43:23,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:43:23,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:43:23,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:43:23,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:43:23,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:43:23,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:43:23,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:43:23,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:43:23,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:43:23,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:43:23,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:43:23,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:43:23,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:43:23,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:43:24,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:43:24,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:43:24,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:43:24,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:43:24,042 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:43:24,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:43:24,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806c3d57d/16c5eff78cc24038a1bb5a0b2091da06/FLAG3738e7f61 [2019-09-08 09:43:24,630 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:43:24,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:43:24,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806c3d57d/16c5eff78cc24038a1bb5a0b2091da06/FLAG3738e7f61 [2019-09-08 09:43:24,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806c3d57d/16c5eff78cc24038a1bb5a0b2091da06 [2019-09-08 09:43:24,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:43:24,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:43:24,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:43:24,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:43:24,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:43:24,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:43:24" (1/1) ... [2019-09-08 09:43:24,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:24, skipping insertion in model container [2019-09-08 09:43:24,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:43:24" (1/1) ... [2019-09-08 09:43:24,979 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:43:25,113 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:43:26,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:43:26,046 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:43:26,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:43:26,416 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:43:26,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26 WrapperNode [2019-09-08 09:43:26,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:43:26,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:43:26,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:43:26,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:43:26,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... [2019-09-08 09:43:26,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:43:26,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:43:26,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:43:26,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:43:26,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:43:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:43:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:43:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:43:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:43:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:43:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:43:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:43:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:43:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:43:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:43:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:43:26,630 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:43:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:43:26,632 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:43:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:43:26,633 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:43:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:43:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:43:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:43:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:43:28,913 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:43:28,913 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:43:28,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:43:28 BoogieIcfgContainer [2019-09-08 09:43:28,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:43:28,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:43:28,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:43:28,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:43:28,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:43:24" (1/3) ... [2019-09-08 09:43:28,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3771e7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:43:28, skipping insertion in model container [2019-09-08 09:43:28,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:43:26" (2/3) ... [2019-09-08 09:43:28,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3771e7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:43:28, skipping insertion in model container [2019-09-08 09:43:28,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:43:28" (3/3) ... [2019-09-08 09:43:28,926 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:43:28,936 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:43:28,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:43:28,974 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:43:29,010 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:43:29,011 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:43:29,011 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:43:29,011 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:43:29,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:43:29,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:43:29,011 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:43:29,012 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:43:29,012 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:43:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states. [2019-09-08 09:43:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:43:29,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:29,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:29,074 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash -278942360, now seen corresponding path program 1 times [2019-09-08 09:43:29,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:29,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:29,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:29,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:30,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:30,045 INFO L87 Difference]: Start difference. First operand 725 states. Second operand 3 states. [2019-09-08 09:43:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:30,363 INFO L93 Difference]: Finished difference Result 1367 states and 2411 transitions. [2019-09-08 09:43:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:30,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:43:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:30,396 INFO L225 Difference]: With dead ends: 1367 [2019-09-08 09:43:30,396 INFO L226 Difference]: Without dead ends: 1173 [2019-09-08 09:43:30,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-09-08 09:43:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1171. [2019-09-08 09:43:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-09-08 09:43:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1818 transitions. [2019-09-08 09:43:30,545 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1818 transitions. Word has length 302 [2019-09-08 09:43:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:30,547 INFO L475 AbstractCegarLoop]: Abstraction has 1171 states and 1818 transitions. [2019-09-08 09:43:30,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1818 transitions. [2019-09-08 09:43:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:43:30,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:30,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:30,556 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1060381776, now seen corresponding path program 1 times [2019-09-08 09:43:30,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:30,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:30,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:30,955 INFO L87 Difference]: Start difference. First operand 1171 states and 1818 transitions. Second operand 3 states. [2019-09-08 09:43:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:31,259 INFO L93 Difference]: Finished difference Result 2395 states and 3745 transitions. [2019-09-08 09:43:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:31,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:43:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:31,275 INFO L225 Difference]: With dead ends: 2395 [2019-09-08 09:43:31,275 INFO L226 Difference]: Without dead ends: 2055 [2019-09-08 09:43:31,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-08 09:43:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2053. [2019-09-08 09:43:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-09-08 09:43:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3174 transitions. [2019-09-08 09:43:31,380 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3174 transitions. Word has length 302 [2019-09-08 09:43:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:31,383 INFO L475 AbstractCegarLoop]: Abstraction has 2053 states and 3174 transitions. [2019-09-08 09:43:31,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3174 transitions. [2019-09-08 09:43:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:43:31,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:31,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:31,393 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -942332820, now seen corresponding path program 1 times [2019-09-08 09:43:31,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:31,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:31,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:31,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:31,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:31,752 INFO L87 Difference]: Start difference. First operand 2053 states and 3174 transitions. Second operand 3 states. [2019-09-08 09:43:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:32,065 INFO L93 Difference]: Finished difference Result 4337 states and 6756 transitions. [2019-09-08 09:43:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:32,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:43:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:32,088 INFO L225 Difference]: With dead ends: 4337 [2019-09-08 09:43:32,089 INFO L226 Difference]: Without dead ends: 3747 [2019-09-08 09:43:32,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-09-08 09:43:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3745. [2019-09-08 09:43:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3745 states. [2019-09-08 09:43:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 5762 transitions. [2019-09-08 09:43:32,232 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 5762 transitions. Word has length 302 [2019-09-08 09:43:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:32,233 INFO L475 AbstractCegarLoop]: Abstraction has 3745 states and 5762 transitions. [2019-09-08 09:43:32,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 5762 transitions. [2019-09-08 09:43:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:43:32,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:32,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:32,244 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1541009136, now seen corresponding path program 1 times [2019-09-08 09:43:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:32,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:32,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:32,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:32,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:32,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:32,984 INFO L87 Difference]: Start difference. First operand 3745 states and 5762 transitions. Second operand 4 states. [2019-09-08 09:43:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:33,467 INFO L93 Difference]: Finished difference Result 11077 states and 17033 transitions. [2019-09-08 09:43:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:33,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 09:43:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:33,504 INFO L225 Difference]: With dead ends: 11077 [2019-09-08 09:43:33,504 INFO L226 Difference]: Without dead ends: 7347 [2019-09-08 09:43:33,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7347 states. [2019-09-08 09:43:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7347 to 7345. [2019-09-08 09:43:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-09-08 09:43:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 11236 transitions. [2019-09-08 09:43:33,830 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 11236 transitions. Word has length 302 [2019-09-08 09:43:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:33,830 INFO L475 AbstractCegarLoop]: Abstraction has 7345 states and 11236 transitions. [2019-09-08 09:43:33,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 11236 transitions. [2019-09-08 09:43:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:43:33,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:33,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:33,848 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1865375771, now seen corresponding path program 1 times [2019-09-08 09:43:33,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:33,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:33,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:33,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:33,977 INFO L87 Difference]: Start difference. First operand 7345 states and 11236 transitions. Second operand 3 states. [2019-09-08 09:43:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:34,567 INFO L93 Difference]: Finished difference Result 21990 states and 33637 transitions. [2019-09-08 09:43:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:43:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:34,635 INFO L225 Difference]: With dead ends: 21990 [2019-09-08 09:43:34,636 INFO L226 Difference]: Without dead ends: 14670 [2019-09-08 09:43:34,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2019-09-08 09:43:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 7358. [2019-09-08 09:43:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-09-08 09:43:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 11255 transitions. [2019-09-08 09:43:35,096 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 11255 transitions. Word has length 304 [2019-09-08 09:43:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:35,097 INFO L475 AbstractCegarLoop]: Abstraction has 7358 states and 11255 transitions. [2019-09-08 09:43:35,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 11255 transitions. [2019-09-08 09:43:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:43:35,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:35,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:35,113 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1755602218, now seen corresponding path program 1 times [2019-09-08 09:43:35,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:35,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:35,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:35,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:35,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:35,460 INFO L87 Difference]: Start difference. First operand 7358 states and 11255 transitions. Second operand 3 states. [2019-09-08 09:43:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:36,018 INFO L93 Difference]: Finished difference Result 21653 states and 33072 transitions. [2019-09-08 09:43:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:36,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:43:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:36,056 INFO L225 Difference]: With dead ends: 21653 [2019-09-08 09:43:36,057 INFO L226 Difference]: Without dead ends: 14437 [2019-09-08 09:43:36,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2019-09-08 09:43:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 14435. [2019-09-08 09:43:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-09-08 09:43:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 21953 transitions. [2019-09-08 09:43:36,706 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 21953 transitions. Word has length 304 [2019-09-08 09:43:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:36,707 INFO L475 AbstractCegarLoop]: Abstraction has 14435 states and 21953 transitions. [2019-09-08 09:43:36,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 21953 transitions. [2019-09-08 09:43:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 09:43:36,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:36,734 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:43:36,735 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1506108170, now seen corresponding path program 1 times [2019-09-08 09:43:36,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:36,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:36,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:36,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:36,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:36,875 INFO L87 Difference]: Start difference. First operand 14435 states and 21953 transitions. Second operand 3 states. [2019-09-08 09:43:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:38,436 INFO L93 Difference]: Finished difference Result 43192 states and 65672 transitions. [2019-09-08 09:43:38,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:38,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 09:43:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:38,516 INFO L225 Difference]: With dead ends: 43192 [2019-09-08 09:43:38,517 INFO L226 Difference]: Without dead ends: 28817 [2019-09-08 09:43:38,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28817 states. [2019-09-08 09:43:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28817 to 14453. [2019-09-08 09:43:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14453 states. [2019-09-08 09:43:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14453 states to 14453 states and 21974 transitions. [2019-09-08 09:43:39,414 INFO L78 Accepts]: Start accepts. Automaton has 14453 states and 21974 transitions. Word has length 305 [2019-09-08 09:43:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:39,415 INFO L475 AbstractCegarLoop]: Abstraction has 14453 states and 21974 transitions. [2019-09-08 09:43:39,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 14453 states and 21974 transitions. [2019-09-08 09:43:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:43:39,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:39,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:39,441 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash 939140209, now seen corresponding path program 1 times [2019-09-08 09:43:39,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:39,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:39,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:39,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:39,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:39,666 INFO L87 Difference]: Start difference. First operand 14453 states and 21974 transitions. Second operand 3 states. [2019-09-08 09:43:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:40,718 INFO L93 Difference]: Finished difference Result 40946 states and 62135 transitions. [2019-09-08 09:43:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:40,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:43:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:40,771 INFO L225 Difference]: With dead ends: 40946 [2019-09-08 09:43:40,772 INFO L226 Difference]: Without dead ends: 26738 [2019-09-08 09:43:40,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26738 states. [2019-09-08 09:43:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26738 to 26736. [2019-09-08 09:43:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26736 states. [2019-09-08 09:43:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26736 states to 26736 states and 40358 transitions. [2019-09-08 09:43:42,912 INFO L78 Accepts]: Start accepts. Automaton has 26736 states and 40358 transitions. Word has length 306 [2019-09-08 09:43:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:42,912 INFO L475 AbstractCegarLoop]: Abstraction has 26736 states and 40358 transitions. [2019-09-08 09:43:42,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26736 states and 40358 transitions. [2019-09-08 09:43:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:43:42,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:42,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:42,954 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -196716786, now seen corresponding path program 1 times [2019-09-08 09:43:42,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:42,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:42,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:43,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:43,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:43,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:43,253 INFO L87 Difference]: Start difference. First operand 26736 states and 40358 transitions. Second operand 4 states. [2019-09-08 09:43:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:44,818 INFO L93 Difference]: Finished difference Result 77559 states and 116851 transitions. [2019-09-08 09:43:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:43:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:44,937 INFO L225 Difference]: With dead ends: 77559 [2019-09-08 09:43:44,937 INFO L226 Difference]: Without dead ends: 51363 [2019-09-08 09:43:44,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:43:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51363 states. [2019-09-08 09:43:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51363 to 26971. [2019-09-08 09:43:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26971 states. [2019-09-08 09:43:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26971 states to 26971 states and 40746 transitions. [2019-09-08 09:43:46,234 INFO L78 Accepts]: Start accepts. Automaton has 26971 states and 40746 transitions. Word has length 306 [2019-09-08 09:43:46,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:46,234 INFO L475 AbstractCegarLoop]: Abstraction has 26971 states and 40746 transitions. [2019-09-08 09:43:46,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26971 states and 40746 transitions. [2019-09-08 09:43:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:43:46,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:46,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:46,261 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:46,261 INFO L82 PathProgramCache]: Analyzing trace with hash -248548203, now seen corresponding path program 1 times [2019-09-08 09:43:46,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:46,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:46,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:46,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:46,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:46,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:46,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:46,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:46,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:46,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:46,384 INFO L87 Difference]: Start difference. First operand 26971 states and 40746 transitions. Second operand 3 states. [2019-09-08 09:43:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:48,445 INFO L93 Difference]: Finished difference Result 79343 states and 119519 transitions. [2019-09-08 09:43:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:48,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:43:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:48,583 INFO L225 Difference]: With dead ends: 79343 [2019-09-08 09:43:48,584 INFO L226 Difference]: Without dead ends: 53175 [2019-09-08 09:43:48,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53175 states. [2019-09-08 09:43:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53175 to 27075. [2019-09-08 09:43:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27075 states. [2019-09-08 09:43:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27075 states to 27075 states and 40889 transitions. [2019-09-08 09:43:49,877 INFO L78 Accepts]: Start accepts. Automaton has 27075 states and 40889 transitions. Word has length 308 [2019-09-08 09:43:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:49,877 INFO L475 AbstractCegarLoop]: Abstraction has 27075 states and 40889 transitions. [2019-09-08 09:43:49,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 27075 states and 40889 transitions. [2019-09-08 09:43:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 09:43:49,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:49,897 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:43:49,898 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1715309788, now seen corresponding path program 1 times [2019-09-08 09:43:49,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:49,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:50,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:50,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:50,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:50,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:50,027 INFO L87 Difference]: Start difference. First operand 27075 states and 40889 transitions. Second operand 3 states. [2019-09-08 09:43:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:51,863 INFO L93 Difference]: Finished difference Result 79475 states and 119685 transitions. [2019-09-08 09:43:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-08 09:43:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:51,975 INFO L225 Difference]: With dead ends: 79475 [2019-09-08 09:43:51,975 INFO L226 Difference]: Without dead ends: 53300 [2019-09-08 09:43:52,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53300 states. [2019-09-08 09:43:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53300 to 27200. [2019-09-08 09:43:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27200 states. [2019-09-08 09:43:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27200 states to 27200 states and 41035 transitions. [2019-09-08 09:43:54,305 INFO L78 Accepts]: Start accepts. Automaton has 27200 states and 41035 transitions. Word has length 309 [2019-09-08 09:43:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:54,305 INFO L475 AbstractCegarLoop]: Abstraction has 27200 states and 41035 transitions. [2019-09-08 09:43:54,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27200 states and 41035 transitions. [2019-09-08 09:43:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:43:54,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:54,329 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:43:54,329 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1582404856, now seen corresponding path program 1 times [2019-09-08 09:43:54,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:54,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:54,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:54,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:54,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:54,718 INFO L87 Difference]: Start difference. First operand 27200 states and 41035 transitions. Second operand 4 states. [2019-09-08 09:43:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:56,206 INFO L93 Difference]: Finished difference Result 55675 states and 84003 transitions. [2019-09-08 09:43:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:43:56,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-08 09:43:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:56,246 INFO L225 Difference]: With dead ends: 55675 [2019-09-08 09:43:56,246 INFO L226 Difference]: Without dead ends: 28044 [2019-09-08 09:43:56,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-09-08 09:43:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28042. [2019-09-08 09:43:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28042 states. [2019-09-08 09:43:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28042 states to 28042 states and 42130 transitions. [2019-09-08 09:43:57,726 INFO L78 Accepts]: Start accepts. Automaton has 28042 states and 42130 transitions. Word has length 310 [2019-09-08 09:43:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:57,726 INFO L475 AbstractCegarLoop]: Abstraction has 28042 states and 42130 transitions. [2019-09-08 09:43:57,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:43:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 28042 states and 42130 transitions. [2019-09-08 09:43:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:43:57,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:57,749 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] [2019-09-08 09:43:57,751 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -170790130, now seen corresponding path program 1 times [2019-09-08 09:43:57,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:57,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:57,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:43:57,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:57,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:57,993 INFO L87 Difference]: Start difference. First operand 28042 states and 42130 transitions. Second operand 3 states. [2019-09-08 09:44:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:00,986 INFO L93 Difference]: Finished difference Result 82732 states and 124130 transitions. [2019-09-08 09:44:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:00,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 09:44:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:01,068 INFO L225 Difference]: With dead ends: 82732 [2019-09-08 09:44:01,068 INFO L226 Difference]: Without dead ends: 54997 [2019-09-08 09:44:01,110 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:44:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54997 states. [2019-09-08 09:44:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54997 to 54995. [2019-09-08 09:44:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54995 states. [2019-09-08 09:44:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54995 states to 54995 states and 82069 transitions. [2019-09-08 09:44:03,495 INFO L78 Accepts]: Start accepts. Automaton has 54995 states and 82069 transitions. Word has length 312 [2019-09-08 09:44:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:03,495 INFO L475 AbstractCegarLoop]: Abstraction has 54995 states and 82069 transitions. [2019-09-08 09:44:03,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 54995 states and 82069 transitions. [2019-09-08 09:44:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:44:03,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:03,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:03,527 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -807669141, now seen corresponding path program 1 times [2019-09-08 09:44:03,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:44:03,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:44:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:44:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:03,810 INFO L87 Difference]: Start difference. First operand 54995 states and 82069 transitions. Second operand 4 states. [2019-09-08 09:44:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:09,642 INFO L93 Difference]: Finished difference Result 161508 states and 240632 transitions. [2019-09-08 09:44:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:09,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:44:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:09,751 INFO L225 Difference]: With dead ends: 161508 [2019-09-08 09:44:09,751 INFO L226 Difference]: Without dead ends: 108882 [2019-09-08 09:44:09,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:44:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108882 states. [2019-09-08 09:44:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108882 to 56174. [2019-09-08 09:44:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56174 states. [2019-09-08 09:44:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56174 states to 56174 states and 84054 transitions. [2019-09-08 09:44:12,814 INFO L78 Accepts]: Start accepts. Automaton has 56174 states and 84054 transitions. Word has length 312 [2019-09-08 09:44:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:12,814 INFO L475 AbstractCegarLoop]: Abstraction has 56174 states and 84054 transitions. [2019-09-08 09:44:12,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:44:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 56174 states and 84054 transitions. [2019-09-08 09:44:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:44:12,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:12,848 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] [2019-09-08 09:44:12,848 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 376159966, now seen corresponding path program 1 times [2019-09-08 09:44:12,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:12,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:12,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:12,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:12,986 INFO L87 Difference]: Start difference. First operand 56174 states and 84054 transitions. Second operand 3 states. [2019-09-08 09:44:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:19,777 INFO L93 Difference]: Finished difference Result 165914 states and 247706 transitions. [2019-09-08 09:44:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:19,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 09:44:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:19,885 INFO L225 Difference]: With dead ends: 165914 [2019-09-08 09:44:19,885 INFO L226 Difference]: Without dead ends: 111103 [2019-09-08 09:44:19,924 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:44:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111103 states. [2019-09-08 09:44:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111103 to 56444. [2019-09-08 09:44:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56444 states. [2019-09-08 09:44:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56444 states to 56444 states and 84404 transitions. [2019-09-08 09:44:22,966 INFO L78 Accepts]: Start accepts. Automaton has 56444 states and 84404 transitions. Word has length 312 [2019-09-08 09:44:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:22,966 INFO L475 AbstractCegarLoop]: Abstraction has 56444 states and 84404 transitions. [2019-09-08 09:44:22,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 56444 states and 84404 transitions. [2019-09-08 09:44:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:44:22,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:22,999 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] [2019-09-08 09:44:22,999 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1135007993, now seen corresponding path program 1 times [2019-09-08 09:44:23,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:23,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:23,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:23,122 INFO L87 Difference]: Start difference. First operand 56444 states and 84404 transitions. Second operand 3 states. [2019-09-08 09:44:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:28,611 INFO L93 Difference]: Finished difference Result 166098 states and 247868 transitions. [2019-09-08 09:44:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:28,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-08 09:44:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:28,725 INFO L225 Difference]: With dead ends: 166098 [2019-09-08 09:44:28,725 INFO L226 Difference]: Without dead ends: 111315 [2019-09-08 09:44:28,779 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:44:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111315 states. [2019-09-08 09:44:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111315 to 56736. [2019-09-08 09:44:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56736 states. [2019-09-08 09:44:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56736 states to 56736 states and 84742 transitions. [2019-09-08 09:44:32,202 INFO L78 Accepts]: Start accepts. Automaton has 56736 states and 84742 transitions. Word has length 313 [2019-09-08 09:44:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:32,203 INFO L475 AbstractCegarLoop]: Abstraction has 56736 states and 84742 transitions. [2019-09-08 09:44:32,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 56736 states and 84742 transitions. [2019-09-08 09:44:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:44:32,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:32,238 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:44:32,238 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 418223679, now seen corresponding path program 1 times [2019-09-08 09:44:32,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:32,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:32,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:32,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:32,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:44:32,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:44:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:44:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:44:32,781 INFO L87 Difference]: Start difference. First operand 56736 states and 84742 transitions. Second operand 3 states. [2019-09-08 09:44:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:39,988 INFO L93 Difference]: Finished difference Result 153889 states and 228883 transitions. [2019-09-08 09:44:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:44:39,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:44:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:40,085 INFO L225 Difference]: With dead ends: 153889 [2019-09-08 09:44:40,086 INFO L226 Difference]: Without dead ends: 103945 [2019-09-08 09:44:40,124 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:44:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103945 states. [2019-09-08 09:44:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103945 to 103943. [2019-09-08 09:44:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103943 states. [2019-09-08 09:44:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103943 states to 103943 states and 153775 transitions. [2019-09-08 09:44:46,092 INFO L78 Accepts]: Start accepts. Automaton has 103943 states and 153775 transitions. Word has length 314 [2019-09-08 09:44:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:46,092 INFO L475 AbstractCegarLoop]: Abstraction has 103943 states and 153775 transitions. [2019-09-08 09:44:46,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 103943 states and 153775 transitions. [2019-09-08 09:44:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:44:46,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:46,154 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:44:46,154 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash -802420284, now seen corresponding path program 1 times [2019-09-08 09:44:46,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:46,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:46,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:46,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:46,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:44:47,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:47,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 09:44:47,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 09:44:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 09:44:47,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:44:47,656 INFO L87 Difference]: Start difference. First operand 103943 states and 153775 transitions. Second operand 18 states. [2019-09-08 09:45:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:04,086 INFO L93 Difference]: Finished difference Result 196009 states and 297692 transitions. [2019-09-08 09:45:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:45:04,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 314 [2019-09-08 09:45:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:04,269 INFO L225 Difference]: With dead ends: 196009 [2019-09-08 09:45:04,269 INFO L226 Difference]: Without dead ends: 176487 [2019-09-08 09:45:04,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 09:45:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176487 states. [2019-09-08 09:45:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176487 to 112254. [2019-09-08 09:45:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112254 states. [2019-09-08 09:45:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112254 states to 112254 states and 165134 transitions. [2019-09-08 09:45:12,591 INFO L78 Accepts]: Start accepts. Automaton has 112254 states and 165134 transitions. Word has length 314 [2019-09-08 09:45:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:12,592 INFO L475 AbstractCegarLoop]: Abstraction has 112254 states and 165134 transitions. [2019-09-08 09:45:12,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 09:45:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 112254 states and 165134 transitions. [2019-09-08 09:45:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:45:12,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:12,662 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:45:12,662 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:12,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1465741368, now seen corresponding path program 1 times [2019-09-08 09:45:12,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:12,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:12,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 09:45:13,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 09:45:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 09:45:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:45:13,490 INFO L87 Difference]: Start difference. First operand 112254 states and 165134 transitions. Second operand 14 states. [2019-09-08 09:45:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:30,381 INFO L93 Difference]: Finished difference Result 201817 states and 302546 transitions. [2019-09-08 09:45:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 09:45:30,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 314 [2019-09-08 09:45:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:30,544 INFO L225 Difference]: With dead ends: 201817 [2019-09-08 09:45:30,545 INFO L226 Difference]: Without dead ends: 178367 [2019-09-08 09:45:30,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2019-09-08 09:45:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178367 states. [2019-09-08 09:45:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178367 to 116010. [2019-09-08 09:45:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116010 states. [2019-09-08 09:45:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116010 states to 116010 states and 170304 transitions. [2019-09-08 09:45:38,814 INFO L78 Accepts]: Start accepts. Automaton has 116010 states and 170304 transitions. Word has length 314 [2019-09-08 09:45:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:38,815 INFO L475 AbstractCegarLoop]: Abstraction has 116010 states and 170304 transitions. [2019-09-08 09:45:38,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 09:45:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 116010 states and 170304 transitions. [2019-09-08 09:45:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:45:38,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:38,888 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:45:38,889 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 710969335, now seen corresponding path program 1 times [2019-09-08 09:45:38,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:38,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:39,766 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-09-08 09:45:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:45:40,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:40,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:45:40,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:45:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:45:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:45:40,190 INFO L87 Difference]: Start difference. First operand 116010 states and 170304 transitions. Second operand 17 states. [2019-09-08 09:45:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:58,526 INFO L93 Difference]: Finished difference Result 203680 states and 306280 transitions. [2019-09-08 09:45:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 09:45:58,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 314 [2019-09-08 09:45:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:58,704 INFO L225 Difference]: With dead ends: 203680 [2019-09-08 09:45:58,704 INFO L226 Difference]: Without dead ends: 184158 [2019-09-08 09:45:58,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=415, Invalid=1225, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 09:45:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184158 states. [2019-09-08 09:46:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184158 to 118922. [2019-09-08 09:46:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118922 states. [2019-09-08 09:46:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118922 states to 118922 states and 174288 transitions. [2019-09-08 09:46:08,633 INFO L78 Accepts]: Start accepts. Automaton has 118922 states and 174288 transitions. Word has length 314 [2019-09-08 09:46:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:08,634 INFO L475 AbstractCegarLoop]: Abstraction has 118922 states and 174288 transitions. [2019-09-08 09:46:08,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:46:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 118922 states and 174288 transitions. [2019-09-08 09:46:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:46:08,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:08,708 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:46:08,708 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1955066345, now seen corresponding path program 1 times [2019-09-08 09:46:08,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:09,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:09,078 INFO L87 Difference]: Start difference. First operand 118922 states and 174288 transitions. Second operand 4 states. [2019-09-08 09:46:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:27,722 INFO L93 Difference]: Finished difference Result 348964 states and 510934 transitions. [2019-09-08 09:46:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:46:27,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:46:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:27,969 INFO L225 Difference]: With dead ends: 348964 [2019-09-08 09:46:27,969 INFO L226 Difference]: Without dead ends: 231250 [2019-09-08 09:46:28,067 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:46:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231250 states. [2019-09-08 09:46:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231250 to 231248. [2019-09-08 09:46:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231248 states. [2019-09-08 09:46:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231248 states to 231248 states and 336813 transitions. [2019-09-08 09:46:48,844 INFO L78 Accepts]: Start accepts. Automaton has 231248 states and 336813 transitions. Word has length 314 [2019-09-08 09:46:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:48,844 INFO L475 AbstractCegarLoop]: Abstraction has 231248 states and 336813 transitions. [2019-09-08 09:46:48,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:46:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 231248 states and 336813 transitions. [2019-09-08 09:46:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:46:48,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:48,999 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:46:48,999 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1762794574, now seen corresponding path program 1 times [2019-09-08 09:46:49,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:49,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:46:49,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:49,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:46:49,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:46:49,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:46:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:46:49,359 INFO L87 Difference]: Start difference. First operand 231248 states and 336813 transitions. Second operand 4 states. [2019-09-08 09:47:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:12,805 INFO L93 Difference]: Finished difference Result 472097 states and 687440 transitions. [2019-09-08 09:47:12,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:47:12,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:47:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:13,080 INFO L225 Difference]: With dead ends: 472097 [2019-09-08 09:47:13,080 INFO L226 Difference]: Without dead ends: 237443 [2019-09-08 09:47:13,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237443 states. [2019-09-08 09:47:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237443 to 237393. [2019-09-08 09:47:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237393 states. [2019-09-08 09:47:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237393 states to 237393 states and 343871 transitions. [2019-09-08 09:47:36,091 INFO L78 Accepts]: Start accepts. Automaton has 237393 states and 343871 transitions. Word has length 314 [2019-09-08 09:47:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:36,091 INFO L475 AbstractCegarLoop]: Abstraction has 237393 states and 343871 transitions. [2019-09-08 09:47:36,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 237393 states and 343871 transitions. [2019-09-08 09:47:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:47:36,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:36,264 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:47:36,264 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash 483456937, now seen corresponding path program 1 times [2019-09-08 09:47:36,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:36,507 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:47:36,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:36,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:47:36,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:47:36,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:47:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:47:36,510 INFO L87 Difference]: Start difference. First operand 237393 states and 343871 transitions. Second operand 4 states. [2019-09-08 09:48:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:18,384 INFO L93 Difference]: Finished difference Result 701346 states and 1015416 transitions. [2019-09-08 09:48:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:18,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:48:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:18,881 INFO L225 Difference]: With dead ends: 701346 [2019-09-08 09:48:18,881 INFO L226 Difference]: Without dead ends: 472283 [2019-09-08 09:48:19,080 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:48:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472283 states. [2019-09-08 09:48:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472283 to 242630. [2019-09-08 09:48:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242630 states. [2019-09-08 09:48:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242630 states to 242630 states and 351828 transitions. [2019-09-08 09:48:47,637 INFO L78 Accepts]: Start accepts. Automaton has 242630 states and 351828 transitions. Word has length 314 [2019-09-08 09:48:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 242630 states and 351828 transitions. [2019-09-08 09:48:47,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 242630 states and 351828 transitions. [2019-09-08 09:48:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:48:47,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:47,798 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:48:47,798 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1897180684, now seen corresponding path program 1 times [2019-09-08 09:48:47,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:47,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:47,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:47,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:47,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:48,102 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:48:48,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:48,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:48:48,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:48:48,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:48:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:48:48,104 INFO L87 Difference]: Start difference. First operand 242630 states and 351828 transitions. Second operand 4 states. [2019-09-08 09:49:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:34,500 INFO L93 Difference]: Finished difference Result 714271 states and 1033513 transitions. [2019-09-08 09:49:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:49:34,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:49:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:35,029 INFO L225 Difference]: With dead ends: 714271 [2019-09-08 09:49:35,029 INFO L226 Difference]: Without dead ends: 472411 [2019-09-08 09:49:35,217 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:49:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472411 states. [2019-09-08 09:50:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472411 to 472409. [2019-09-08 09:50:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472409 states. [2019-09-08 09:50:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472409 states to 472409 states and 678825 transitions. [2019-09-08 09:50:31,397 INFO L78 Accepts]: Start accepts. Automaton has 472409 states and 678825 transitions. Word has length 314 [2019-09-08 09:50:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:31,397 INFO L475 AbstractCegarLoop]: Abstraction has 472409 states and 678825 transitions. [2019-09-08 09:50:31,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:50:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 472409 states and 678825 transitions. [2019-09-08 09:50:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:50:31,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:31,696 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:50:31,697 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1893492335, now seen corresponding path program 1 times [2019-09-08 09:50:31,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:31,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:31,882 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:50:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:31,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:31,884 INFO L87 Difference]: Start difference. First operand 472409 states and 678825 transitions. Second operand 3 states. [2019-09-08 09:52:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:02,668 INFO L93 Difference]: Finished difference Result 1382739 states and 1982562 transitions. [2019-09-08 09:52:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:02,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 09:52:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:04,107 INFO L225 Difference]: With dead ends: 1382739 [2019-09-08 09:52:04,107 INFO L226 Difference]: Without dead ends: 925357 [2019-09-08 09:52:04,421 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:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925357 states. [2019-09-08 09:53:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925357 to 925355. [2019-09-08 09:53:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925355 states. [2019-09-08 09:53:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925355 states to 925355 states and 1318530 transitions. [2019-09-08 09:53:52,986 INFO L78 Accepts]: Start accepts. Automaton has 925355 states and 1318530 transitions. Word has length 316 [2019-09-08 09:53:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:52,986 INFO L475 AbstractCegarLoop]: Abstraction has 925355 states and 1318530 transitions. [2019-09-08 09:53:52,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 925355 states and 1318530 transitions. [2019-09-08 09:53:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:53:53,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:53,698 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:53:53,698 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:53,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1727485654, now seen corresponding path program 1 times [2019-09-08 09:53:53,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:53,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:53,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:53,818 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:53,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:53,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:53,820 INFO L87 Difference]: Start difference. First operand 925355 states and 1318530 transitions. Second operand 3 states.