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_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:38:29,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:38:29,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:38:29,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:38:29,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:38:29,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:38:29,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:38:29,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:38:29,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:38:29,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:38:29,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:38:29,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:38:29,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:38:29,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:38:29,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:38:29,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:38:29,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:38:29,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:38:29,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:38:29,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:38:29,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:38:29,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:38:29,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:38:29,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:38:29,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:38:29,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:38:29,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:38:29,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:38:29,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:38:29,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:38:29,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:38:29,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:38:29,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:38:29,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:38:29,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:38:29,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:38:29,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:38:29,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:38:29,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:38:29,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:38:29,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:38:29,881 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 13:38:29,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:38:29,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:38:29,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:38:29,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:38:29,925 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:38:29,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:38:29,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:38:29,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:38:29,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:38:29,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:38:29,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:38:29,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:38:29,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:38:29,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:38:29,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:38:29,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:38:29,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:38:29,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:38:29,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:38:29,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:38:29,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:38:29,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:38:29,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:38:29,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:38:29,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:38:29,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:38:29,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:38:29,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:38:29,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:38:29,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:38:29,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:38:30,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:38:30,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:38:30,003 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:38:30,004 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:38:30,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3679463/a41c6588c0e742a68b66dcb094e79b92/FLAG876bb520d [2019-09-08 13:38:30,997 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:38:30,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:38:31,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3679463/a41c6588c0e742a68b66dcb094e79b92/FLAG876bb520d [2019-09-08 13:38:31,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3679463/a41c6588c0e742a68b66dcb094e79b92 [2019-09-08 13:38:31,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:38:31,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:38:31,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:38:31,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:38:31,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:38:31,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:38:31" (1/1) ... [2019-09-08 13:38:31,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c5f355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:31, skipping insertion in model container [2019-09-08 13:38:31,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:38:31" (1/1) ... [2019-09-08 13:38:31,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:38:32,038 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:38:36,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:38:36,262 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:38:39,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:38:39,469 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:38:39,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39 WrapperNode [2019-09-08 13:38:39,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:38:39,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:38:39,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:38:39,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:38:39,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:39,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (1/1) ... [2019-09-08 13:38:40,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:38:40,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:38:40,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:38:40,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:38:40,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (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 13:38:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:38:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:38:40,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:38:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:38:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:38:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:38:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:38:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:38:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:38:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:38:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:38:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:38:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:38:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:38:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:38:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:38:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:38:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:38:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:38:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:38:53,706 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:38:53,706 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:38:53,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:38:53 BoogieIcfgContainer [2019-09-08 13:38:53,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:38:53,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:38:53,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:38:53,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:38:53,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:38:31" (1/3) ... [2019-09-08 13:38:53,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce65e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:38:53, skipping insertion in model container [2019-09-08 13:38:53,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:38:39" (2/3) ... [2019-09-08 13:38:53,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce65e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:38:53, skipping insertion in model container [2019-09-08 13:38:53,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:38:53" (3/3) ... [2019-09-08 13:38:53,719 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.3.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:38:53,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:38:53,739 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:38:53,755 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:38:53,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:38:53,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:38:53,815 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:38:53,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:38:53,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:38:53,816 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:38:53,816 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:38:53,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:38:53,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:38:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states. [2019-09-08 13:38:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:38:53,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:53,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:53,990 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1564128118, now seen corresponding path program 1 times [2019-09-08 13:38:53,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:55,079 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 13:38:55,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:55,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:55,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:55,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:55,098 INFO L87 Difference]: Start difference. First operand 6854 states. Second operand 3 states. [2019-09-08 13:38:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:55,700 INFO L93 Difference]: Finished difference Result 13616 states and 23592 transitions. [2019-09-08 13:38:55,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:55,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:38:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:55,762 INFO L225 Difference]: With dead ends: 13616 [2019-09-08 13:38:55,762 INFO L226 Difference]: Without dead ends: 8178 [2019-09-08 13:38:55,781 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 13:38:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-09-08 13:38:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8176. [2019-09-08 13:38:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-09-08 13:38:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 13671 transitions. [2019-09-08 13:38:56,175 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 13671 transitions. Word has length 392 [2019-09-08 13:38:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:56,180 INFO L475 AbstractCegarLoop]: Abstraction has 8176 states and 13671 transitions. [2019-09-08 13:38:56,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 13671 transitions. [2019-09-08 13:38:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:38:56,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:56,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:56,218 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash -671030645, now seen corresponding path program 1 times [2019-09-08 13:38:56,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:56,764 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 13:38:56,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:56,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:56,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:56,770 INFO L87 Difference]: Start difference. First operand 8176 states and 13671 transitions. Second operand 3 states. [2019-09-08 13:38:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:57,560 INFO L93 Difference]: Finished difference Result 14039 states and 23468 transitions. [2019-09-08 13:38:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:57,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:38:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:57,621 INFO L225 Difference]: With dead ends: 14039 [2019-09-08 13:38:57,621 INFO L226 Difference]: Without dead ends: 11950 [2019-09-08 13:38:57,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 13:38:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11950 states. [2019-09-08 13:38:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11950 to 11948. [2019-09-08 13:38:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11948 states. [2019-09-08 13:38:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 19912 transitions. [2019-09-08 13:38:58,057 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 19912 transitions. Word has length 392 [2019-09-08 13:38:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:58,060 INFO L475 AbstractCegarLoop]: Abstraction has 11948 states and 19912 transitions. [2019-09-08 13:38:58,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 19912 transitions. [2019-09-08 13:38:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:38:58,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:58,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:58,117 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash -516159413, now seen corresponding path program 1 times [2019-09-08 13:38:58,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:58,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:58,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:58,653 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 13:38:58,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:58,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:58,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:58,656 INFO L87 Difference]: Start difference. First operand 11948 states and 19912 transitions. Second operand 3 states. [2019-09-08 13:38:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:59,917 INFO L93 Difference]: Finished difference Result 20760 states and 34756 transitions. [2019-09-08 13:38:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:59,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:38:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:59,997 INFO L225 Difference]: With dead ends: 20760 [2019-09-08 13:38:59,997 INFO L226 Difference]: Without dead ends: 18394 [2019-09-08 13:39:00,022 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 13:39:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18394 states. [2019-09-08 13:39:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18394 to 18392. [2019-09-08 13:39:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-09-08 13:39:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 30718 transitions. [2019-09-08 13:39:00,788 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 30718 transitions. Word has length 392 [2019-09-08 13:39:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:00,789 INFO L475 AbstractCegarLoop]: Abstraction has 18392 states and 30718 transitions. [2019-09-08 13:39:00,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 30718 transitions. [2019-09-08 13:39:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:00,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:00,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:00,842 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1946068491, now seen corresponding path program 1 times [2019-09-08 13:39:00,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:00,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:00,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:00,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:01,231 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 13:39:01,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:01,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:01,234 INFO L87 Difference]: Start difference. First operand 18392 states and 30718 transitions. Second operand 3 states. [2019-09-08 13:39:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:03,257 INFO L93 Difference]: Finished difference Result 34504 states and 57654 transitions. [2019-09-08 13:39:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:03,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:39:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:04,359 INFO L225 Difference]: With dead ends: 34504 [2019-09-08 13:39:04,359 INFO L226 Difference]: Without dead ends: 30398 [2019-09-08 13:39:04,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30398 states. [2019-09-08 13:39:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30398 to 30396. [2019-09-08 13:39:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30396 states. [2019-09-08 13:39:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30396 states to 30396 states and 50590 transitions. [2019-09-08 13:39:05,250 INFO L78 Accepts]: Start accepts. Automaton has 30396 states and 50590 transitions. Word has length 392 [2019-09-08 13:39:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:05,251 INFO L475 AbstractCegarLoop]: Abstraction has 30396 states and 50590 transitions. [2019-09-08 13:39:05,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30396 states and 50590 transitions. [2019-09-08 13:39:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:05,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:05,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:05,319 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2079890613, now seen corresponding path program 1 times [2019-09-08 13:39:05,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:05,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:05,627 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 13:39:05,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:05,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:05,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:05,629 INFO L87 Difference]: Start difference. First operand 30396 states and 50590 transitions. Second operand 3 states. [2019-09-08 13:39:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:07,020 INFO L93 Difference]: Finished difference Result 50288 states and 83512 transitions. [2019-09-08 13:39:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:07,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:39:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:07,133 INFO L225 Difference]: With dead ends: 50288 [2019-09-08 13:39:07,134 INFO L226 Difference]: Without dead ends: 47014 [2019-09-08 13:39:07,159 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 13:39:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-09-08 13:39:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 37068. [2019-09-08 13:39:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37068 states. [2019-09-08 13:39:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37068 states to 37068 states and 61806 transitions. [2019-09-08 13:39:08,340 INFO L78 Accepts]: Start accepts. Automaton has 37068 states and 61806 transitions. Word has length 392 [2019-09-08 13:39:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:08,341 INFO L475 AbstractCegarLoop]: Abstraction has 37068 states and 61806 transitions. [2019-09-08 13:39:08,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 37068 states and 61806 transitions. [2019-09-08 13:39:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:08,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:08,391 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1730300334, now seen corresponding path program 1 times [2019-09-08 13:39:08,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:09,331 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 13:39:09,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:09,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:09,334 INFO L87 Difference]: Start difference. First operand 37068 states and 61806 transitions. Second operand 3 states. [2019-09-08 13:39:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:10,433 INFO L93 Difference]: Finished difference Result 88532 states and 147816 transitions. [2019-09-08 13:39:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:10,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:39:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:10,566 INFO L225 Difference]: With dead ends: 88532 [2019-09-08 13:39:10,567 INFO L226 Difference]: Without dead ends: 53762 [2019-09-08 13:39:10,650 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 13:39:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53762 states. [2019-09-08 13:39:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53762 to 52864. [2019-09-08 13:39:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52864 states. [2019-09-08 13:39:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52864 states to 52864 states and 87838 transitions. [2019-09-08 13:39:13,865 INFO L78 Accepts]: Start accepts. Automaton has 52864 states and 87838 transitions. Word has length 392 [2019-09-08 13:39:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:13,866 INFO L475 AbstractCegarLoop]: Abstraction has 52864 states and 87838 transitions. [2019-09-08 13:39:13,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52864 states and 87838 transitions. [2019-09-08 13:39:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:13,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:13,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:13,926 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 580759541, now seen corresponding path program 1 times [2019-09-08 13:39:13,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:13,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:13,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:13,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:14,395 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 13:39:14,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:14,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:14,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:14,397 INFO L87 Difference]: Start difference. First operand 52864 states and 87838 transitions. Second operand 3 states. [2019-09-08 13:39:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:15,950 INFO L93 Difference]: Finished difference Result 134888 states and 224888 transitions. [2019-09-08 13:39:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:15,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:39:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:16,063 INFO L225 Difference]: With dead ends: 134888 [2019-09-08 13:39:16,064 INFO L226 Difference]: Without dead ends: 87398 [2019-09-08 13:39:16,152 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 13:39:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87398 states. [2019-09-08 13:39:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87398 to 83100. [2019-09-08 13:39:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83100 states. [2019-09-08 13:39:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83100 states to 83100 states and 137312 transitions. [2019-09-08 13:39:20,207 INFO L78 Accepts]: Start accepts. Automaton has 83100 states and 137312 transitions. Word has length 392 [2019-09-08 13:39:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:20,208 INFO L475 AbstractCegarLoop]: Abstraction has 83100 states and 137312 transitions. [2019-09-08 13:39:20,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 83100 states and 137312 transitions. [2019-09-08 13:39:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:20,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:20,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:20,278 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -220383142, now seen corresponding path program 1 times [2019-09-08 13:39:20,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:21,470 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 13:39:21,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:39:21,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:39:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:39:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:39:21,472 INFO L87 Difference]: Start difference. First operand 83100 states and 137312 transitions. Second operand 8 states. [2019-09-08 13:39:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:26,888 INFO L93 Difference]: Finished difference Result 221890 states and 370263 transitions. [2019-09-08 13:39:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:39:26,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2019-09-08 13:39:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:27,111 INFO L225 Difference]: With dead ends: 221890 [2019-09-08 13:39:27,111 INFO L226 Difference]: Without dead ends: 192448 [2019-09-08 13:39:27,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:39:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192448 states. [2019-09-08 13:39:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192448 to 143356. [2019-09-08 13:39:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143356 states. [2019-09-08 13:39:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143356 states to 143356 states and 237940 transitions. [2019-09-08 13:39:34,257 INFO L78 Accepts]: Start accepts. Automaton has 143356 states and 237940 transitions. Word has length 392 [2019-09-08 13:39:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:34,259 INFO L475 AbstractCegarLoop]: Abstraction has 143356 states and 237940 transitions. [2019-09-08 13:39:34,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:39:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 143356 states and 237940 transitions. [2019-09-08 13:39:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:34,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:34,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:34,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2050190897, now seen corresponding path program 1 times [2019-09-08 13:39:34,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:34,802 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 13:39:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:34,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:34,804 INFO L87 Difference]: Start difference. First operand 143356 states and 237940 transitions. Second operand 3 states. [2019-09-08 13:39:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:37,770 INFO L93 Difference]: Finished difference Result 206912 states and 344846 transitions. [2019-09-08 13:39:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:37,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:39:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:37,887 INFO L225 Difference]: With dead ends: 206912 [2019-09-08 13:39:37,888 INFO L226 Difference]: Without dead ends: 90670 [2019-09-08 13:39:37,978 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 13:39:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90670 states. [2019-09-08 13:39:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90670 to 90668. [2019-09-08 13:39:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90668 states. [2019-09-08 13:39:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90668 states to 90668 states and 150732 transitions. [2019-09-08 13:39:43,854 INFO L78 Accepts]: Start accepts. Automaton has 90668 states and 150732 transitions. Word has length 392 [2019-09-08 13:39:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:43,854 INFO L475 AbstractCegarLoop]: Abstraction has 90668 states and 150732 transitions. [2019-09-08 13:39:43,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 90668 states and 150732 transitions. [2019-09-08 13:39:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:39:43,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:43,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:43,883 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -735449498, now seen corresponding path program 1 times [2019-09-08 13:39:43,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:45,344 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 13:39:45,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:45,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:39:45,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:39:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:39:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:39:45,345 INFO L87 Difference]: Start difference. First operand 90668 states and 150732 transitions. Second operand 8 states. [2019-09-08 13:40:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:03,542 INFO L93 Difference]: Finished difference Result 501460 states and 835838 transitions. [2019-09-08 13:40:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:40:03,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2019-09-08 13:40:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:04,161 INFO L225 Difference]: With dead ends: 501460 [2019-09-08 13:40:04,161 INFO L226 Difference]: Without dead ends: 431346 [2019-09-08 13:40:04,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:40:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431346 states. [2019-09-08 13:40:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431346 to 265670. [2019-09-08 13:40:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265670 states. [2019-09-08 13:40:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265670 states to 265670 states and 442435 transitions. [2019-09-08 13:40:16,295 INFO L78 Accepts]: Start accepts. Automaton has 265670 states and 442435 transitions. Word has length 392 [2019-09-08 13:40:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:16,296 INFO L475 AbstractCegarLoop]: Abstraction has 265670 states and 442435 transitions. [2019-09-08 13:40:16,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:40:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 265670 states and 442435 transitions. [2019-09-08 13:40:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:40:17,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:17,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:17,114 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash -425553466, now seen corresponding path program 1 times [2019-09-08 13:40:17,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:17,510 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 13:40:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:17,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:17,511 INFO L87 Difference]: Start difference. First operand 265670 states and 442435 transitions. Second operand 3 states. [2019-09-08 13:40:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:33,764 INFO L93 Difference]: Finished difference Result 562426 states and 936829 transitions. [2019-09-08 13:40:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:33,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-08 13:40:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:34,271 INFO L225 Difference]: With dead ends: 562426 [2019-09-08 13:40:34,272 INFO L226 Difference]: Without dead ends: 360416 [2019-09-08 13:40:34,448 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 13:40:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360416 states. [2019-09-08 13:40:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360416 to 331406. [2019-09-08 13:40:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331406 states. [2019-09-08 13:41:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331406 states to 331406 states and 550407 transitions. [2019-09-08 13:41:00,267 INFO L78 Accepts]: Start accepts. Automaton has 331406 states and 550407 transitions. Word has length 392 [2019-09-08 13:41:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:00,267 INFO L475 AbstractCegarLoop]: Abstraction has 331406 states and 550407 transitions. [2019-09-08 13:41:00,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:41:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 331406 states and 550407 transitions. [2019-09-08 13:41:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:41:00,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:00,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:00,335 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1875628507, now seen corresponding path program 1 times [2019-09-08 13:41:00,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:00,965 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 13:41:00,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:00,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:41:00,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:41:00,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:41:00,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:41:00,967 INFO L87 Difference]: Start difference. First operand 331406 states and 550407 transitions. Second operand 7 states. [2019-09-08 13:42:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:29,095 INFO L93 Difference]: Finished difference Result 1814726 states and 3027861 transitions. [2019-09-08 13:42:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:42:29,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 396 [2019-09-08 13:42:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:31,883 INFO L225 Difference]: With dead ends: 1814726 [2019-09-08 13:42:31,884 INFO L226 Difference]: Without dead ends: 1542340 [2019-09-08 13:42:32,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:42:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542340 states. [2019-09-08 13:43:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542340 to 778942. [2019-09-08 13:43:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778942 states. [2019-09-08 13:43:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778942 states to 778942 states and 1296863 transitions. [2019-09-08 13:43:56,325 INFO L78 Accepts]: Start accepts. Automaton has 778942 states and 1296863 transitions. Word has length 396 [2019-09-08 13:43:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:43:56,326 INFO L475 AbstractCegarLoop]: Abstraction has 778942 states and 1296863 transitions. [2019-09-08 13:43:56,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:43:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 778942 states and 1296863 transitions. [2019-09-08 13:43:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:43:56,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:43:56,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:43:56,391 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:43:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:43:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1189444082, now seen corresponding path program 1 times [2019-09-08 13:43:56,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:43:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:43:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:43:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:43:56,806 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 13:43:56,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:43:56,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:43:56,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:43:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:43:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:43:56,808 INFO L87 Difference]: Start difference. First operand 778942 states and 1296863 transitions. Second operand 3 states. [2019-09-08 13:45:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:45:21,612 INFO L93 Difference]: Finished difference Result 1744410 states and 2898619 transitions. [2019-09-08 13:45:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:45:21,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:45:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:45:23,406 INFO L225 Difference]: With dead ends: 1744410 [2019-09-08 13:45:23,407 INFO L226 Difference]: Without dead ends: 1024668 [2019-09-08 13:45:24,798 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 13:45:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024668 states. [2019-09-08 13:46:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024668 to 788926. [2019-09-08 13:46:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788926 states. [2019-09-08 13:46:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788926 states to 788926 states and 1303415 transitions. [2019-09-08 13:46:48,000 INFO L78 Accepts]: Start accepts. Automaton has 788926 states and 1303415 transitions. Word has length 396 [2019-09-08 13:46:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:46:48,001 INFO L475 AbstractCegarLoop]: Abstraction has 788926 states and 1303415 transitions. [2019-09-08 13:46:48,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:46:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 788926 states and 1303415 transitions. [2019-09-08 13:46:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 13:46:48,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:46:48,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:48,091 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:46:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:46:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1623944903, now seen corresponding path program 1 times [2019-09-08 13:46:48,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:46:48,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:46:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:48,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:46:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:46:48,466 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 13:46:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:46:48,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:46:48,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:46:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:46:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:46:48,471 INFO L87 Difference]: Start difference. First operand 788926 states and 1303415 transitions. Second operand 3 states. [2019-09-08 13:48:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:48:38,848 INFO L93 Difference]: Finished difference Result 1917529 states and 3168852 transitions. [2019-09-08 13:48:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:48:38,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2019-09-08 13:48:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:48:41,254 INFO L225 Difference]: With dead ends: 1917529 [2019-09-08 13:48:41,254 INFO L226 Difference]: Without dead ends: 1403667 [2019-09-08 13:48:41,744 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 13:48:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403667 states.