java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:55:18,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:55:18,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:55:18,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:55:18,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:55:18,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:55:18,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:55:18,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:55:18,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:55:18,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:55:18,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:55:18,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:55:18,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:55:18,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:55:18,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:55:18,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:55:18,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:55:18,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:55:18,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:55:18,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:55:18,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:55:18,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:55:18,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:55:18,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:55:18,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:55:18,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:55:18,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:55:18,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:55:18,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:55:18,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:55:18,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:55:18,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:55:18,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:55:18,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:55:18,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:55:18,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:55:18,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:55:18,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:55:18,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:55:18,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:55:18,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:55:18,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:55:18,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:55:18,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:55:18,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:55:18,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:55:18,885 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:55:18,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:55:18,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:55:18,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:55:18,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:55:18,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:55:18,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:55:18,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:55:18,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:55:18,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:55:18,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:55:18,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:55:18,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:55:18,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:55:18,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:55:18,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:55:18,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:55:18,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:55:18,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:55:18,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:55:18,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:55:18,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:55:18,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:55:18,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:55:18,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:55:18,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:55:18,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:55:18,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:55:18,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:55:18,939 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:55:18,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:55:19,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1489752d/e67e77cf333a4b15b4f72348aa2c7f90/FLAGcaefab1a5 [2019-09-08 09:55:19,702 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:55:19,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:55:19,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1489752d/e67e77cf333a4b15b4f72348aa2c7f90/FLAGcaefab1a5 [2019-09-08 09:55:19,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1489752d/e67e77cf333a4b15b4f72348aa2c7f90 [2019-09-08 09:55:19,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:55:19,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:55:19,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:55:19,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:55:19,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:55:19,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:55:19" (1/1) ... [2019-09-08 09:55:19,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2231e286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:19, skipping insertion in model container [2019-09-08 09:55:19,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:55:19" (1/1) ... [2019-09-08 09:55:19,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:55:20,048 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:55:21,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:55:21,304 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:55:22,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:55:22,110 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:55:22,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22 WrapperNode [2019-09-08 09:55:22,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:55:22,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:55:22,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:55:22,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:55:22,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... [2019-09-08 09:55:22,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:55:22,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:55:22,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:55:22,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:55:22,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:55:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:55:22,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:55:22,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:55:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:55:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:55:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:55:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:55:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:55:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:55:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:55:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:55:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:55:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:55:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:55:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:55:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:55:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:55:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:55:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:55:25,243 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:55:25,243 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:55:25,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:55:25 BoogieIcfgContainer [2019-09-08 09:55:25,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:55:25,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:55:25,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:55:25,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:55:25,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:55:19" (1/3) ... [2019-09-08 09:55:25,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77715650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:55:25, skipping insertion in model container [2019-09-08 09:55:25,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:55:22" (2/3) ... [2019-09-08 09:55:25,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77715650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:55:25, skipping insertion in model container [2019-09-08 09:55:25,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:55:25" (3/3) ... [2019-09-08 09:55:25,252 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:55:25,262 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:55:25,271 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:55:25,287 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:55:25,330 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:55:25,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:55:25,330 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:55:25,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:55:25,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:55:25,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:55:25,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:55:25,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:55:25,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:55:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states. [2019-09-08 09:55:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:55:25,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:25,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:25,400 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 879468556, now seen corresponding path program 1 times [2019-09-08 09:55:25,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:25,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:26,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:26,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:26,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:26,974 INFO L87 Difference]: Start difference. First operand 894 states. Second operand 4 states. [2019-09-08 09:55:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:27,310 INFO L93 Difference]: Finished difference Result 2637 states and 4768 transitions. [2019-09-08 09:55:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:55:27,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-09-08 09:55:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:27,347 INFO L225 Difference]: With dead ends: 2637 [2019-09-08 09:55:27,348 INFO L226 Difference]: Without dead ends: 1750 [2019-09-08 09:55:27,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:55:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-09-08 09:55:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1659. [2019-09-08 09:55:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-08 09:55:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2536 transitions. [2019-09-08 09:55:27,513 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2536 transitions. Word has length 298 [2019-09-08 09:55:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:27,514 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2536 transitions. [2019-09-08 09:55:27,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2536 transitions. [2019-09-08 09:55:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:55:27,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:27,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:27,527 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2014471081, now seen corresponding path program 1 times [2019-09-08 09:55:27,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:27,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:27,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:27,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:27,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:27,942 INFO L87 Difference]: Start difference. First operand 1659 states and 2536 transitions. Second operand 3 states. [2019-09-08 09:55:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:28,175 INFO L93 Difference]: Finished difference Result 4792 states and 7292 transitions. [2019-09-08 09:55:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:28,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:55:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:28,197 INFO L225 Difference]: With dead ends: 4792 [2019-09-08 09:55:28,197 INFO L226 Difference]: Without dead ends: 3262 [2019-09-08 09:55:28,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-09-08 09:55:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3171. [2019-09-08 09:55:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2019-09-08 09:55:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4846 transitions. [2019-09-08 09:55:28,344 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4846 transitions. Word has length 300 [2019-09-08 09:55:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:28,346 INFO L475 AbstractCegarLoop]: Abstraction has 3171 states and 4846 transitions. [2019-09-08 09:55:28,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4846 transitions. [2019-09-08 09:55:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:55:28,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:28,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:28,358 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -86719460, now seen corresponding path program 1 times [2019-09-08 09:55:28,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:28,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:28,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:28,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:28,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:28,572 INFO L87 Difference]: Start difference. First operand 3171 states and 4846 transitions. Second operand 3 states. [2019-09-08 09:55:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:28,807 INFO L93 Difference]: Finished difference Result 9438 states and 14414 transitions. [2019-09-08 09:55:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:28,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:55:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:28,843 INFO L225 Difference]: With dead ends: 9438 [2019-09-08 09:55:28,843 INFO L226 Difference]: Without dead ends: 6309 [2019-09-08 09:55:28,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2019-09-08 09:55:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 3190. [2019-09-08 09:55:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-09-08 09:55:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4874 transitions. [2019-09-08 09:55:29,080 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4874 transitions. Word has length 300 [2019-09-08 09:55:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:29,081 INFO L475 AbstractCegarLoop]: Abstraction has 3190 states and 4874 transitions. [2019-09-08 09:55:29,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4874 transitions. [2019-09-08 09:55:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 09:55:29,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:29,102 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] [2019-09-08 09:55:29,103 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash -251320664, now seen corresponding path program 1 times [2019-09-08 09:55:29,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:29,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:29,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:29,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:29,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:29,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:29,344 INFO L87 Difference]: Start difference. First operand 3190 states and 4874 transitions. Second operand 3 states. [2019-09-08 09:55:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:29,712 INFO L93 Difference]: Finished difference Result 9457 states and 14435 transitions. [2019-09-08 09:55:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:29,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-08 09:55:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:29,745 INFO L225 Difference]: With dead ends: 9457 [2019-09-08 09:55:29,745 INFO L226 Difference]: Without dead ends: 6327 [2019-09-08 09:55:29,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2019-09-08 09:55:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 3208. [2019-09-08 09:55:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-09-08 09:55:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4895 transitions. [2019-09-08 09:55:29,965 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4895 transitions. Word has length 301 [2019-09-08 09:55:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 3208 states and 4895 transitions. [2019-09-08 09:55:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4895 transitions. [2019-09-08 09:55:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:55:29,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:29,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:29,976 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603182, now seen corresponding path program 1 times [2019-09-08 09:55:29,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:29,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:29,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:29,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:29,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:30,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:30,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:30,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:30,240 INFO L87 Difference]: Start difference. First operand 3208 states and 4895 transitions. Second operand 3 states. [2019-09-08 09:55:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:30,605 INFO L93 Difference]: Finished difference Result 9177 states and 13934 transitions. [2019-09-08 09:55:30,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:30,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 09:55:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:30,650 INFO L225 Difference]: With dead ends: 9177 [2019-09-08 09:55:30,650 INFO L226 Difference]: Without dead ends: 6214 [2019-09-08 09:55:30,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2019-09-08 09:55:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 6123. [2019-09-08 09:55:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6123 states. [2019-09-08 09:55:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 9297 transitions. [2019-09-08 09:55:31,057 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 9297 transitions. Word has length 302 [2019-09-08 09:55:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:31,059 INFO L475 AbstractCegarLoop]: Abstraction has 6123 states and 9297 transitions. [2019-09-08 09:55:31,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 9297 transitions. [2019-09-08 09:55:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:55:31,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:31,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:31,074 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash -673500497, now seen corresponding path program 1 times [2019-09-08 09:55:31,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:31,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:31,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:31,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:31,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:31,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:31,421 INFO L87 Difference]: Start difference. First operand 6123 states and 9297 transitions. Second operand 4 states. [2019-09-08 09:55:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:31,942 INFO L93 Difference]: Finished difference Result 16797 states and 25309 transitions. [2019-09-08 09:55:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:31,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 09:55:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:31,971 INFO L225 Difference]: With dead ends: 16797 [2019-09-08 09:55:31,972 INFO L226 Difference]: Without dead ends: 11214 [2019-09-08 09:55:31,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:55:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2019-09-08 09:55:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 6358. [2019-09-08 09:55:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6358 states. [2019-09-08 09:55:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 9685 transitions. [2019-09-08 09:55:32,328 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 9685 transitions. Word has length 302 [2019-09-08 09:55:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:32,328 INFO L475 AbstractCegarLoop]: Abstraction has 6358 states and 9685 transitions. [2019-09-08 09:55:32,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 9685 transitions. [2019-09-08 09:55:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:55:32,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:32,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:32,344 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1900469541, now seen corresponding path program 1 times [2019-09-08 09:55:32,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:32,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:32,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:32,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:32,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:32,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:32,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:32,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:32,488 INFO L87 Difference]: Start difference. First operand 6358 states and 9685 transitions. Second operand 3 states. [2019-09-08 09:55:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:33,126 INFO L93 Difference]: Finished difference Result 17504 states and 26336 transitions. [2019-09-08 09:55:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:33,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:55:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:33,150 INFO L225 Difference]: With dead ends: 17504 [2019-09-08 09:55:33,150 INFO L226 Difference]: Without dead ends: 11949 [2019-09-08 09:55:33,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11949 states. [2019-09-08 09:55:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11949 to 6462. [2019-09-08 09:55:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2019-09-08 09:55:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 9828 transitions. [2019-09-08 09:55:33,504 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 9828 transitions. Word has length 304 [2019-09-08 09:55:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:33,505 INFO L475 AbstractCegarLoop]: Abstraction has 6462 states and 9828 transitions. [2019-09-08 09:55:33,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 9828 transitions. [2019-09-08 09:55:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 09:55:33,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:33,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:33,521 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:33,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash 261434929, now seen corresponding path program 1 times [2019-09-08 09:55:33,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:33,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:33,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:33,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:33,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:33,662 INFO L87 Difference]: Start difference. First operand 6462 states and 9828 transitions. Second operand 3 states. [2019-09-08 09:55:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:34,225 INFO L93 Difference]: Finished difference Result 17636 states and 26502 transitions. [2019-09-08 09:55:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:34,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 09:55:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:34,250 INFO L225 Difference]: With dead ends: 17636 [2019-09-08 09:55:34,250 INFO L226 Difference]: Without dead ends: 12074 [2019-09-08 09:55:34,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12074 states. [2019-09-08 09:55:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12074 to 6587. [2019-09-08 09:55:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6587 states. [2019-09-08 09:55:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 9974 transitions. [2019-09-08 09:55:34,666 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 9974 transitions. Word has length 305 [2019-09-08 09:55:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:34,666 INFO L475 AbstractCegarLoop]: Abstraction has 6587 states and 9974 transitions. [2019-09-08 09:55:34,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 9974 transitions. [2019-09-08 09:55:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:55:34,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:34,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:34,683 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash -185535570, now seen corresponding path program 1 times [2019-09-08 09:55:34,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:34,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:34,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:34,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:34,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:35,000 INFO L87 Difference]: Start difference. First operand 6587 states and 9974 transitions. Second operand 4 states. [2019-09-08 09:55:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:35,264 INFO L93 Difference]: Finished difference Result 11528 states and 17332 transitions. [2019-09-08 09:55:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:35,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:55:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:35,276 INFO L225 Difference]: With dead ends: 11528 [2019-09-08 09:55:35,277 INFO L226 Difference]: Without dead ends: 5804 [2019-09-08 09:55:35,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:55:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-09-08 09:55:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5784. [2019-09-08 09:55:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-09-08 09:55:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 8775 transitions. [2019-09-08 09:55:35,622 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 8775 transitions. Word has length 306 [2019-09-08 09:55:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:35,623 INFO L475 AbstractCegarLoop]: Abstraction has 5784 states and 8775 transitions. [2019-09-08 09:55:35,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 8775 transitions. [2019-09-08 09:55:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:55:35,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:35,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:35,639 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:35,640 INFO L82 PathProgramCache]: Analyzing trace with hash 872440992, now seen corresponding path program 1 times [2019-09-08 09:55:35,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:35,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:35,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:35,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:35,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:35,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:35,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:35,935 INFO L87 Difference]: Start difference. First operand 5784 states and 8775 transitions. Second operand 3 states. [2019-09-08 09:55:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:37,354 INFO L93 Difference]: Finished difference Result 13924 states and 20945 transitions. [2019-09-08 09:55:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:37,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-08 09:55:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:37,376 INFO L225 Difference]: With dead ends: 13924 [2019-09-08 09:55:37,377 INFO L226 Difference]: Without dead ends: 9848 [2019-09-08 09:55:37,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2019-09-08 09:55:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 9757. [2019-09-08 09:55:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9757 states. [2019-09-08 09:55:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9757 states to 9757 states and 14680 transitions. [2019-09-08 09:55:37,940 INFO L78 Accepts]: Start accepts. Automaton has 9757 states and 14680 transitions. Word has length 307 [2019-09-08 09:55:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:37,941 INFO L475 AbstractCegarLoop]: Abstraction has 9757 states and 14680 transitions. [2019-09-08 09:55:37,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9757 states and 14680 transitions. [2019-09-08 09:55:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:55:37,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:37,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:37,961 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash 167056645, now seen corresponding path program 1 times [2019-09-08 09:55:37,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:37,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:38,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:38,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:55:38,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:55:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:55:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:55:38,451 INFO L87 Difference]: Start difference. First operand 9757 states and 14680 transitions. Second operand 8 states. [2019-09-08 09:55:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:41,364 INFO L93 Difference]: Finished difference Result 22833 states and 35036 transitions. [2019-09-08 09:55:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:55:41,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2019-09-08 09:55:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:41,393 INFO L225 Difference]: With dead ends: 22833 [2019-09-08 09:55:41,393 INFO L226 Difference]: Without dead ends: 14960 [2019-09-08 09:55:41,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:55:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2019-09-08 09:55:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 10789. [2019-09-08 09:55:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10789 states. [2019-09-08 09:55:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 16160 transitions. [2019-09-08 09:55:42,017 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 16160 transitions. Word has length 307 [2019-09-08 09:55:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:42,018 INFO L475 AbstractCegarLoop]: Abstraction has 10789 states and 16160 transitions. [2019-09-08 09:55:42,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:55:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 16160 transitions. [2019-09-08 09:55:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:55:42,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:42,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:42,036 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash -639901102, now seen corresponding path program 1 times [2019-09-08 09:55:42,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:42,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:42,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:42,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:42,882 INFO L87 Difference]: Start difference. First operand 10789 states and 16160 transitions. Second operand 4 states. [2019-09-08 09:55:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:44,200 INFO L93 Difference]: Finished difference Result 31714 states and 47434 transitions. [2019-09-08 09:55:44,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:44,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-09-08 09:55:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:44,238 INFO L225 Difference]: With dead ends: 31714 [2019-09-08 09:55:44,238 INFO L226 Difference]: Without dead ends: 20997 [2019-09-08 09:55:44,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:55:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20997 states. [2019-09-08 09:55:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20997 to 20909. [2019-09-08 09:55:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20909 states. [2019-09-08 09:55:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20909 states to 20909 states and 31092 transitions. [2019-09-08 09:55:45,511 INFO L78 Accepts]: Start accepts. Automaton has 20909 states and 31092 transitions. Word has length 307 [2019-09-08 09:55:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:45,512 INFO L475 AbstractCegarLoop]: Abstraction has 20909 states and 31092 transitions. [2019-09-08 09:55:45,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20909 states and 31092 transitions. [2019-09-08 09:55:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 09:55:45,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:45,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:45,540 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash 903586634, now seen corresponding path program 1 times [2019-09-08 09:55:45,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:45,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:45,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:45,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:45,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:45,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:45,751 INFO L87 Difference]: Start difference. First operand 20909 states and 31092 transitions. Second operand 3 states. [2019-09-08 09:55:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:47,993 INFO L93 Difference]: Finished difference Result 60210 states and 89166 transitions. [2019-09-08 09:55:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:47,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-08 09:55:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:48,034 INFO L225 Difference]: With dead ends: 60210 [2019-09-08 09:55:48,034 INFO L226 Difference]: Without dead ends: 40550 [2019-09-08 09:55:48,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40550 states. [2019-09-08 09:55:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40550 to 40464. [2019-09-08 09:55:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40464 states. [2019-09-08 09:55:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40464 states to 40464 states and 59723 transitions. [2019-09-08 09:55:50,182 INFO L78 Accepts]: Start accepts. Automaton has 40464 states and 59723 transitions. Word has length 309 [2019-09-08 09:55:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:50,182 INFO L475 AbstractCegarLoop]: Abstraction has 40464 states and 59723 transitions. [2019-09-08 09:55:50,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40464 states and 59723 transitions. [2019-09-08 09:55:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:55:50,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:50,207 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] [2019-09-08 09:55:50,208 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2000096977, now seen corresponding path program 1 times [2019-09-08 09:55:50,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:50,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:50,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:50,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:50,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:50,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:50,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:50,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:50,479 INFO L87 Difference]: Start difference. First operand 40464 states and 59723 transitions. Second operand 3 states. [2019-09-08 09:55:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:55,122 INFO L93 Difference]: Finished difference Result 118250 states and 173991 transitions. [2019-09-08 09:55:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:55,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:55:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:55,199 INFO L225 Difference]: With dead ends: 118250 [2019-09-08 09:55:55,199 INFO L226 Difference]: Without dead ends: 79133 [2019-09-08 09:55:55,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79133 states. [2019-09-08 09:55:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79133 to 79049. [2019-09-08 09:55:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79049 states. [2019-09-08 09:55:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79049 states to 79049 states and 115698 transitions. [2019-09-08 09:55:59,308 INFO L78 Accepts]: Start accepts. Automaton has 79049 states and 115698 transitions. Word has length 311 [2019-09-08 09:55:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:59,309 INFO L475 AbstractCegarLoop]: Abstraction has 79049 states and 115698 transitions. [2019-09-08 09:55:59,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79049 states and 115698 transitions. [2019-09-08 09:55:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:55:59,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:59,374 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] [2019-09-08 09:55:59,374 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash -268509838, now seen corresponding path program 1 times [2019-09-08 09:55:59,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:59,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:59,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:59,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:59,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:59,736 INFO L87 Difference]: Start difference. First operand 79049 states and 115698 transitions. Second operand 4 states. [2019-09-08 09:56:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:07,226 INFO L93 Difference]: Finished difference Result 209020 states and 304930 transitions. [2019-09-08 09:56:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:07,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-09-08 09:56:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:07,369 INFO L225 Difference]: With dead ends: 209020 [2019-09-08 09:56:07,369 INFO L226 Difference]: Without dead ends: 133263 [2019-09-08 09:56:07,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133263 states. [2019-09-08 09:56:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133263 to 77210. [2019-09-08 09:56:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77210 states. [2019-09-08 09:56:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77210 states to 77210 states and 113072 transitions. [2019-09-08 09:56:13,826 INFO L78 Accepts]: Start accepts. Automaton has 77210 states and 113072 transitions. Word has length 311 [2019-09-08 09:56:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:13,826 INFO L475 AbstractCegarLoop]: Abstraction has 77210 states and 113072 transitions. [2019-09-08 09:56:13,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77210 states and 113072 transitions. [2019-09-08 09:56:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:56:13,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:13,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:13,887 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:13,887 INFO L82 PathProgramCache]: Analyzing trace with hash 348476886, now seen corresponding path program 1 times [2019-09-08 09:56:13,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:13,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:14,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:14,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:14,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:14,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:14,025 INFO L87 Difference]: Start difference. First operand 77210 states and 113072 transitions. Second operand 3 states. [2019-09-08 09:56:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:22,741 INFO L93 Difference]: Finished difference Result 205359 states and 299476 transitions. [2019-09-08 09:56:22,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:22,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:56:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:22,875 INFO L225 Difference]: With dead ends: 205359 [2019-09-08 09:56:22,875 INFO L226 Difference]: Without dead ends: 135098 [2019-09-08 09:56:22,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135098 states. [2019-09-08 09:56:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135098 to 77691. [2019-09-08 09:56:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77691 states. [2019-09-08 09:56:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77691 states to 77691 states and 113670 transitions. [2019-09-08 09:56:27,746 INFO L78 Accepts]: Start accepts. Automaton has 77691 states and 113670 transitions. Word has length 314 [2019-09-08 09:56:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:27,746 INFO L475 AbstractCegarLoop]: Abstraction has 77691 states and 113670 transitions. [2019-09-08 09:56:27,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 77691 states and 113670 transitions. [2019-09-08 09:56:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 09:56:27,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:27,793 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] [2019-09-08 09:56:27,793 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1786640950, now seen corresponding path program 1 times [2019-09-08 09:56:27,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:27,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:27,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:27,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:27,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:28,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:28,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:28,106 INFO L87 Difference]: Start difference. First operand 77691 states and 113670 transitions. Second operand 4 states. [2019-09-08 09:56:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:31,989 INFO L93 Difference]: Finished difference Result 141963 states and 206945 transitions. [2019-09-08 09:56:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:31,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-09-08 09:56:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:32,070 INFO L225 Difference]: With dead ends: 141963 [2019-09-08 09:56:32,070 INFO L226 Difference]: Without dead ends: 69584 [2019-09-08 09:56:32,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69584 states. [2019-09-08 09:56:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69584 to 69257. [2019-09-08 09:56:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69257 states. [2019-09-08 09:56:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69257 states to 69257 states and 101214 transitions. [2019-09-08 09:56:38,545 INFO L78 Accepts]: Start accepts. Automaton has 69257 states and 101214 transitions. Word has length 315 [2019-09-08 09:56:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:38,545 INFO L475 AbstractCegarLoop]: Abstraction has 69257 states and 101214 transitions. [2019-09-08 09:56:38,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 69257 states and 101214 transitions. [2019-09-08 09:56:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:56:38,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:38,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:38,584 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -748494562, now seen corresponding path program 1 times [2019-09-08 09:56:38,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:39,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:39,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:39,152 INFO L87 Difference]: Start difference. First operand 69257 states and 101214 transitions. Second operand 4 states. [2019-09-08 09:56:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:46,688 INFO L93 Difference]: Finished difference Result 197365 states and 288100 transitions. [2019-09-08 09:56:46,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:56:46,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 09:56:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:46,807 INFO L225 Difference]: With dead ends: 197365 [2019-09-08 09:56:46,807 INFO L226 Difference]: Without dead ends: 128326 [2019-09-08 09:56:46,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128326 states. [2019-09-08 09:56:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128326 to 128256. [2019-09-08 09:56:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128256 states. [2019-09-08 09:56:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128256 states to 128256 states and 185891 transitions. [2019-09-08 09:56:55,192 INFO L78 Accepts]: Start accepts. Automaton has 128256 states and 185891 transitions. Word has length 316 [2019-09-08 09:56:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:55,193 INFO L475 AbstractCegarLoop]: Abstraction has 128256 states and 185891 transitions. [2019-09-08 09:56:55,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 128256 states and 185891 transitions. [2019-09-08 09:56:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 09:56:55,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:55,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:55,264 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1841320925, now seen corresponding path program 1 times [2019-09-08 09:56:55,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:55,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:55,476 INFO L87 Difference]: Start difference. First operand 128256 states and 185891 transitions. Second operand 3 states. [2019-09-08 09:57:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:11,683 INFO L93 Difference]: Finished difference Result 374168 states and 541126 transitions. [2019-09-08 09:57:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:11,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 09:57:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:11,954 INFO L225 Difference]: With dead ends: 374168 [2019-09-08 09:57:11,954 INFO L226 Difference]: Without dead ends: 250589 [2019-09-08 09:57:12,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250589 states. [2019-09-08 09:57:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250589 to 250275. [2019-09-08 09:57:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250275 states. [2019-09-08 09:57:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250275 states to 250275 states and 359929 transitions. [2019-09-08 09:57:35,351 INFO L78 Accepts]: Start accepts. Automaton has 250275 states and 359929 transitions. Word has length 318 [2019-09-08 09:57:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:35,351 INFO L475 AbstractCegarLoop]: Abstraction has 250275 states and 359929 transitions. [2019-09-08 09:57:35,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:57:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 250275 states and 359929 transitions. [2019-09-08 09:57:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:57:35,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:35,513 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] [2019-09-08 09:57:35,513 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1602373406, now seen corresponding path program 1 times [2019-09-08 09:57:35,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:35,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:35,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:35,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:57:35,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:57:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:57:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:57:35,744 INFO L87 Difference]: Start difference. First operand 250275 states and 359929 transitions. Second operand 3 states. [2019-09-08 09:58:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:11,896 INFO L93 Difference]: Finished difference Result 729299 states and 1045184 transitions. [2019-09-08 09:58:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:58:11,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 09:58:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:12,489 INFO L225 Difference]: With dead ends: 729299 [2019-09-08 09:58:12,489 INFO L226 Difference]: Without dead ends: 489877 [2019-09-08 09:58:12,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:58:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489877 states. [2019-09-08 09:58:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489877 to 489823. [2019-09-08 09:58:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489823 states. [2019-09-08 09:58:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489823 states to 489823 states and 697442 transitions. [2019-09-08 09:58:54,047 INFO L78 Accepts]: Start accepts. Automaton has 489823 states and 697442 transitions. Word has length 320 [2019-09-08 09:58:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:54,047 INFO L475 AbstractCegarLoop]: Abstraction has 489823 states and 697442 transitions. [2019-09-08 09:58:54,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:58:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 489823 states and 697442 transitions. [2019-09-08 09:59:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:59:00,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:00,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:00,928 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash 670669179, now seen corresponding path program 1 times [2019-09-08 09:59:00,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:00,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:00,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:00,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:00,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:01,254 INFO L87 Difference]: Start difference. First operand 489823 states and 697442 transitions. Second operand 4 states. [2019-09-08 09:59:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:59,933 INFO L93 Difference]: Finished difference Result 1196354 states and 1698728 transitions. [2019-09-08 09:59:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:59,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 09:59:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:00,881 INFO L225 Difference]: With dead ends: 1196354 [2019-09-08 10:00:00,881 INFO L226 Difference]: Without dead ends: 747278 [2019-09-08 10:00:01,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:00:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747278 states. [2019-09-08 10:00:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747278 to 466859. [2019-09-08 10:00:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466859 states. [2019-09-08 10:00:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466859 states to 466859 states and 664798 transitions. [2019-09-08 10:00:48,706 INFO L78 Accepts]: Start accepts. Automaton has 466859 states and 664798 transitions. Word has length 320 [2019-09-08 10:00:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:48,706 INFO L475 AbstractCegarLoop]: Abstraction has 466859 states and 664798 transitions. [2019-09-08 10:00:48,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:00:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 466859 states and 664798 transitions. [2019-09-08 10:00:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 10:00:49,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:49,035 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] [2019-09-08 10:00:49,036 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -607694389, now seen corresponding path program 1 times [2019-09-08 10:00:49,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:49,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:00:49,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:49,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:49,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:49,173 INFO L87 Difference]: Start difference. First operand 466859 states and 664798 transitions. Second operand 3 states. [2019-09-08 10:01:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:01:57,856 INFO L93 Difference]: Finished difference Result 1207784 states and 1712466 transitions. [2019-09-08 10:01:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:01:57,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 10:01:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:01:58,894 INFO L225 Difference]: With dead ends: 1207784 [2019-09-08 10:01:58,894 INFO L226 Difference]: Without dead ends: 792605 [2019-09-08 10:01:59,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792605 states. [2019-09-08 10:02:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792605 to 466319. [2019-09-08 10:02:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466319 states. [2019-09-08 10:02:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466319 states to 466319 states and 663200 transitions. [2019-09-08 10:02:48,362 INFO L78 Accepts]: Start accepts. Automaton has 466319 states and 663200 transitions. Word has length 323 [2019-09-08 10:02:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:48,363 INFO L475 AbstractCegarLoop]: Abstraction has 466319 states and 663200 transitions. [2019-09-08 10:02:48,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 466319 states and 663200 transitions. [2019-09-08 10:02:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 10:02:48,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:48,643 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] [2019-09-08 10:02:48,644 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2099548108, now seen corresponding path program 1 times [2019-09-08 10:02:48,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:48,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:48,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:48,940 INFO L87 Difference]: Start difference. First operand 466319 states and 663200 transitions. Second operand 4 states. [2019-09-08 10:03:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:28,131 INFO L93 Difference]: Finished difference Result 847518 states and 1201419 transitions. [2019-09-08 10:03:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:28,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 10:03:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:29,079 INFO L225 Difference]: With dead ends: 847518 [2019-09-08 10:03:29,079 INFO L226 Difference]: Without dead ends: 426350 [2019-09-08 10:03:29,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426350 states. [2019-09-08 10:04:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426350 to 423072. [2019-09-08 10:04:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423072 states. [2019-09-08 10:04:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423072 states to 423072 states and 600920 transitions. [2019-09-08 10:04:09,551 INFO L78 Accepts]: Start accepts. Automaton has 423072 states and 600920 transitions. Word has length 324 [2019-09-08 10:04:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:09,551 INFO L475 AbstractCegarLoop]: Abstraction has 423072 states and 600920 transitions. [2019-09-08 10:04:09,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 423072 states and 600920 transitions. [2019-09-08 10:04:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 10:04:09,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:09,813 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] [2019-09-08 10:04:09,813 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -159531066, now seen corresponding path program 1 times [2019-09-08 10:04:09,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:10,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:10,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:04:10,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:04:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:04:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:04:10,191 INFO L87 Difference]: Start difference. First operand 423072 states and 600920 transitions. Second operand 5 states. [2019-09-08 10:05:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:32,093 INFO L93 Difference]: Finished difference Result 1082352 states and 1569026 transitions. [2019-09-08 10:05:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:05:32,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2019-09-08 10:05:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:34,121 INFO L225 Difference]: With dead ends: 1082352 [2019-09-08 10:05:34,122 INFO L226 Difference]: Without dead ends: 965426 [2019-09-08 10:05:34,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965426 states.