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_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:15:20,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:15:20,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:15:20,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:15:20,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:15:20,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:15:20,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:15:20,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:15:20,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:15:20,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:15:20,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:15:20,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:15:20,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:15:20,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:15:20,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:15:20,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:15:20,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:15:20,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:15:20,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:15:20,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:15:20,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:15:20,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:15:20,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:15:20,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:15:20,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:15:20,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:15:20,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:15:20,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:15:20,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:15:20,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:15:20,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:15:20,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:15:20,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:15:20,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:15:20,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:15:20,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:15:20,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:15:20,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:15:20,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:15:20,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:15:20,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:15:20,908 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 12:15:20,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:15:20,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:15:20,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:15:20,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:15:20,939 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:15:20,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:15:20,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:15:20,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:15:20,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:15:20,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:15:20,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:15:20,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:15:20,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:15:20,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:15:20,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:15:20,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:15:20,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:15:20,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:15:20,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:15:20,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:15:20,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:15:20,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:15:20,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:15:20,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:15:20,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:15:20,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:15:20,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:15:20,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:15:20,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:15:20,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:15:20,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:15:20,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:15:20,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:15:20,996 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:15:20,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:15:21,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbd29f63/551967cc7d6940dd9127a58975a0ba86/FLAGae9693b8b [2019-09-08 12:15:21,804 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:15:21,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:15:21,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbd29f63/551967cc7d6940dd9127a58975a0ba86/FLAGae9693b8b [2019-09-08 12:15:21,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbd29f63/551967cc7d6940dd9127a58975a0ba86 [2019-09-08 12:15:21,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:15:21,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:15:21,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:15:21,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:15:21,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:15:21,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:15:21" (1/1) ... [2019-09-08 12:15:21,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ec451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:21, skipping insertion in model container [2019-09-08 12:15:21,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:15:21" (1/1) ... [2019-09-08 12:15:21,976 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:15:22,128 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:15:23,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:15:23,306 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:15:23,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:15:23,689 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:15:23,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23 WrapperNode [2019-09-08 12:15:23,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:15:23,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:15:23,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:15:23,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:15:23,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (1/1) ... [2019-09-08 12:15:23,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:15:23,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:15:23,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:15:23,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:15:23,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (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 12:15:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:15:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:15:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:15:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:15:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:15:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:15:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:15:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:15:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:15:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:15:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:15:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:15:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:15:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:15:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:15:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:15:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:15:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:15:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:15:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:15:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:15:27,538 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:15:27,538 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:15:27,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:15:27 BoogieIcfgContainer [2019-09-08 12:15:27,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:15:27,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:15:27,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:15:27,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:15:27,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:15:21" (1/3) ... [2019-09-08 12:15:27,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b732cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:15:27, skipping insertion in model container [2019-09-08 12:15:27,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:23" (2/3) ... [2019-09-08 12:15:27,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b732cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:15:27, skipping insertion in model container [2019-09-08 12:15:27,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:15:27" (3/3) ... [2019-09-08 12:15:27,549 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:15:27,559 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:15:27,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:15:27,587 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:15:27,628 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:15:27,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:15:27,629 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:15:27,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:15:27,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:15:27,630 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:15:27,630 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:15:27,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:15:27,630 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:15:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states. [2019-09-08 12:15:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:15:27,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:27,713 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] [2019-09-08 12:15:27,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2026715041, now seen corresponding path program 1 times [2019-09-08 12:15:27,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:27,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:28,376 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 12:15:28,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:28,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:15:28,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:15:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:15:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:28,403 INFO L87 Difference]: Start difference. First operand 1116 states. Second operand 5 states. [2019-09-08 12:15:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:29,700 INFO L93 Difference]: Finished difference Result 1265 states and 2224 transitions. [2019-09-08 12:15:29,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:29,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:15:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:29,741 INFO L225 Difference]: With dead ends: 1265 [2019-09-08 12:15:29,742 INFO L226 Difference]: Without dead ends: 704 [2019-09-08 12:15:29,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:15:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-08 12:15:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-09-08 12:15:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-08 12:15:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 889 transitions. [2019-09-08 12:15:29,895 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 889 transitions. Word has length 76 [2019-09-08 12:15:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:29,896 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 889 transitions. [2019-09-08 12:15:29,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:15:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 889 transitions. [2019-09-08 12:15:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:15:29,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:29,901 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] [2019-09-08 12:15:29,901 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1438864747, now seen corresponding path program 1 times [2019-09-08 12:15:29,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:29,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:30,105 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 12:15:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:15:30,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:15:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:15:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:30,108 INFO L87 Difference]: Start difference. First operand 704 states and 889 transitions. Second operand 5 states. [2019-09-08 12:15:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:30,605 INFO L93 Difference]: Finished difference Result 913 states and 1162 transitions. [2019-09-08 12:15:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:30,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:15:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:30,609 INFO L225 Difference]: With dead ends: 913 [2019-09-08 12:15:30,610 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 12:15:30,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:15:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 12:15:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-09-08 12:15:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 12:15:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 698 transitions. [2019-09-08 12:15:30,634 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 698 transitions. Word has length 76 [2019-09-08 12:15:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:30,634 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 698 transitions. [2019-09-08 12:15:30,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:15:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 698 transitions. [2019-09-08 12:15:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:15:30,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:30,637 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] [2019-09-08 12:15:30,637 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1708480706, now seen corresponding path program 1 times [2019-09-08 12:15:30,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:30,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:30,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:30,828 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 12:15:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:15:30,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:15:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:15:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:30,830 INFO L87 Difference]: Start difference. First operand 546 states and 698 transitions. Second operand 5 states. [2019-09-08 12:15:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:31,235 INFO L93 Difference]: Finished difference Result 775 states and 1005 transitions. [2019-09-08 12:15:31,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:31,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:15:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:31,240 INFO L225 Difference]: With dead ends: 775 [2019-09-08 12:15:31,240 INFO L226 Difference]: Without dead ends: 480 [2019-09-08 12:15:31,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:15:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-08 12:15:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-08 12:15:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-08 12:15:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 621 transitions. [2019-09-08 12:15:31,261 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 621 transitions. Word has length 76 [2019-09-08 12:15:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:31,262 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 621 transitions. [2019-09-08 12:15:31,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:15:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2019-09-08 12:15:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:15:31,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:31,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:31,265 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 755366932, now seen corresponding path program 1 times [2019-09-08 12:15:31,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:31,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:31,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:31,374 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 12:15:31,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:31,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:15:31,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:15:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:15:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:31,376 INFO L87 Difference]: Start difference. First operand 480 states and 621 transitions. Second operand 5 states. [2019-09-08 12:15:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:31,856 INFO L93 Difference]: Finished difference Result 719 states and 940 transitions. [2019-09-08 12:15:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:31,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:15:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:31,860 INFO L225 Difference]: With dead ends: 719 [2019-09-08 12:15:31,861 INFO L226 Difference]: Without dead ends: 464 [2019-09-08 12:15:31,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:15:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-08 12:15:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-08 12:15:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 12:15:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 602 transitions. [2019-09-08 12:15:31,882 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 602 transitions. Word has length 77 [2019-09-08 12:15:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:31,883 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 602 transitions. [2019-09-08 12:15:31,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:15:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 602 transitions. [2019-09-08 12:15:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:15:31,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:31,885 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] [2019-09-08 12:15:31,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1886479960, now seen corresponding path program 1 times [2019-09-08 12:15:31,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:31,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:31,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:31,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 12:15:31,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:31,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:15:31,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:15:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:15:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:15:32,000 INFO L87 Difference]: Start difference. First operand 464 states and 602 transitions. Second operand 5 states. [2019-09-08 12:15:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:32,524 INFO L93 Difference]: Finished difference Result 641 states and 828 transitions. [2019-09-08 12:15:32,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:32,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 12:15:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:32,529 INFO L225 Difference]: With dead ends: 641 [2019-09-08 12:15:32,529 INFO L226 Difference]: Without dead ends: 394 [2019-09-08 12:15:32,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:15:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-08 12:15:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-09-08 12:15:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 509 transitions. [2019-09-08 12:15:32,556 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 509 transitions. Word has length 78 [2019-09-08 12:15:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:32,556 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 509 transitions. [2019-09-08 12:15:32,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:15:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 509 transitions. [2019-09-08 12:15:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:15:32,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:32,558 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] [2019-09-08 12:15:32,559 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash -213392593, now seen corresponding path program 1 times [2019-09-08 12:15:32,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:32,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:32,830 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 12:15:32,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:32,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:15:32,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:15:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:15:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:15:32,832 INFO L87 Difference]: Start difference. First operand 394 states and 509 transitions. Second operand 8 states. [2019-09-08 12:15:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:33,601 INFO L93 Difference]: Finished difference Result 758 states and 966 transitions. [2019-09-08 12:15:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:15:33,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-08 12:15:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:33,606 INFO L225 Difference]: With dead ends: 758 [2019-09-08 12:15:33,607 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 12:15:33,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:15:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 12:15:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 394. [2019-09-08 12:15:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2019-09-08 12:15:33,629 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 79 [2019-09-08 12:15:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:33,630 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2019-09-08 12:15:33,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:15:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2019-09-08 12:15:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:15:33,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:33,632 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] [2019-09-08 12:15:33,632 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -929977429, now seen corresponding path program 1 times [2019-09-08 12:15:33,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:33,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:33,869 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 12:15:33,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:33,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:33,872 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand 9 states. [2019-09-08 12:15:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:35,065 INFO L93 Difference]: Finished difference Result 803 states and 1072 transitions. [2019-09-08 12:15:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:35,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 12:15:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:35,069 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:15:35,069 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:35,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 507 transitions. [2019-09-08 12:15:35,096 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 507 transitions. Word has length 79 [2019-09-08 12:15:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:35,096 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 507 transitions. [2019-09-08 12:15:35,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 507 transitions. [2019-09-08 12:15:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:15:35,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:35,098 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] [2019-09-08 12:15:35,099 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -868457063, now seen corresponding path program 1 times [2019-09-08 12:15:35,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:35,266 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 12:15:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:35,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:35,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:35,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:35,268 INFO L87 Difference]: Start difference. First operand 394 states and 507 transitions. Second operand 9 states. [2019-09-08 12:15:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:37,052 INFO L93 Difference]: Finished difference Result 867 states and 1162 transitions. [2019-09-08 12:15:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:37,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 12:15:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:37,058 INFO L225 Difference]: With dead ends: 867 [2019-09-08 12:15:37,059 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 12:15:37,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 12:15:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-08 12:15:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2019-09-08 12:15:37,104 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 79 [2019-09-08 12:15:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:37,105 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2019-09-08 12:15:37,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2019-09-08 12:15:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:37,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:37,108 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] [2019-09-08 12:15:37,109 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1890090262, now seen corresponding path program 1 times [2019-09-08 12:15:37,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:37,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:37,390 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 12:15:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:37,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:37,393 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand 9 states. [2019-09-08 12:15:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:38,868 INFO L93 Difference]: Finished difference Result 744 states and 978 transitions. [2019-09-08 12:15:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:38,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:38,876 INFO L225 Difference]: With dead ends: 744 [2019-09-08 12:15:38,876 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:38,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2019-09-08 12:15:38,910 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 81 [2019-09-08 12:15:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:38,910 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2019-09-08 12:15:38,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2019-09-08 12:15:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:38,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:38,912 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] [2019-09-08 12:15:38,913 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1898902830, now seen corresponding path program 1 times [2019-09-08 12:15:38,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:38,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:39,151 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 12:15:39,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:39,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:39,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:39,153 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand 9 states. [2019-09-08 12:15:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:40,981 INFO L93 Difference]: Finished difference Result 833 states and 1111 transitions. [2019-09-08 12:15:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:40,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:40,988 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:15:40,992 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:15:40,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:15:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:15:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 504 transitions. [2019-09-08 12:15:41,047 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 504 transitions. Word has length 81 [2019-09-08 12:15:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:41,048 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 504 transitions. [2019-09-08 12:15:41,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 504 transitions. [2019-09-08 12:15:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:41,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:41,056 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] [2019-09-08 12:15:41,057 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash 59601677, now seen corresponding path program 1 times [2019-09-08 12:15:41,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:41,299 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 12:15:41,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:41,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:41,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:41,301 INFO L87 Difference]: Start difference. First operand 394 states and 504 transitions. Second operand 9 states. [2019-09-08 12:15:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:42,536 INFO L93 Difference]: Finished difference Result 803 states and 1066 transitions. [2019-09-08 12:15:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:42,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:42,541 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:15:42,541 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:42,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 503 transitions. [2019-09-08 12:15:42,574 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 503 transitions. Word has length 81 [2019-09-08 12:15:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:42,575 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 503 transitions. [2019-09-08 12:15:42,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 503 transitions. [2019-09-08 12:15:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:42,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:42,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:42,577 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash 916645204, now seen corresponding path program 1 times [2019-09-08 12:15:42,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:42,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:42,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:42,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:42,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:42,751 INFO L87 Difference]: Start difference. First operand 394 states and 503 transitions. Second operand 9 states. [2019-09-08 12:15:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:44,069 INFO L93 Difference]: Finished difference Result 882 states and 1168 transitions. [2019-09-08 12:15:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:44,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:44,074 INFO L225 Difference]: With dead ends: 882 [2019-09-08 12:15:44,074 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 12:15:44,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 12:15:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-08 12:15:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 502 transitions. [2019-09-08 12:15:44,111 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 502 transitions. Word has length 81 [2019-09-08 12:15:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:44,111 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 502 transitions. [2019-09-08 12:15:44,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2019-09-08 12:15:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:44,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:44,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:44,117 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash -819894320, now seen corresponding path program 1 times [2019-09-08 12:15:44,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:44,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:44,304 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 12:15:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:44,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:44,306 INFO L87 Difference]: Start difference. First operand 394 states and 502 transitions. Second operand 9 states. [2019-09-08 12:15:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:45,851 INFO L93 Difference]: Finished difference Result 824 states and 1101 transitions. [2019-09-08 12:15:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:45,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:45,856 INFO L225 Difference]: With dead ends: 824 [2019-09-08 12:15:45,856 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:15:45,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:15:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:15:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-09-08 12:15:45,891 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 81 [2019-09-08 12:15:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:45,892 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-09-08 12:15:45,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-09-08 12:15:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:45,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:45,893 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] [2019-09-08 12:15:45,894 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash 494668223, now seen corresponding path program 1 times [2019-09-08 12:15:45,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:45,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:45,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:46,060 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 12:15:46,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:46,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:46,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:46,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:46,062 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 9 states. [2019-09-08 12:15:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:47,269 INFO L93 Difference]: Finished difference Result 799 states and 1060 transitions. [2019-09-08 12:15:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:47,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:47,275 INFO L225 Difference]: With dead ends: 799 [2019-09-08 12:15:47,275 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:47,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2019-09-08 12:15:47,313 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 81 [2019-09-08 12:15:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:47,314 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2019-09-08 12:15:47,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2019-09-08 12:15:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:47,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:47,315 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] [2019-09-08 12:15:47,316 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1431462676, now seen corresponding path program 1 times [2019-09-08 12:15:47,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:47,487 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 12:15:47,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:47,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:47,489 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 9 states. [2019-09-08 12:15:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:49,051 INFO L93 Difference]: Finished difference Result 833 states and 1109 transitions. [2019-09-08 12:15:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:49,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:49,055 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:15:49,055 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:15:49,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:15:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:15:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 499 transitions. [2019-09-08 12:15:49,089 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 499 transitions. Word has length 81 [2019-09-08 12:15:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:49,090 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 499 transitions. [2019-09-08 12:15:49,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2019-09-08 12:15:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:15:49,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:49,091 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] [2019-09-08 12:15:49,092 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -272719777, now seen corresponding path program 1 times [2019-09-08 12:15:49,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:49,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:49,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:49,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:49,262 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 12:15:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:49,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:49,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:49,264 INFO L87 Difference]: Start difference. First operand 394 states and 499 transitions. Second operand 9 states. [2019-09-08 12:15:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:50,566 INFO L93 Difference]: Finished difference Result 803 states and 1062 transitions. [2019-09-08 12:15:50,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:50,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:15:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:50,570 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:15:50,570 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:50,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2019-09-08 12:15:50,607 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 81 [2019-09-08 12:15:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:50,607 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2019-09-08 12:15:50,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2019-09-08 12:15:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:50,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:50,609 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] [2019-09-08 12:15:50,609 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1337474297, now seen corresponding path program 1 times [2019-09-08 12:15:50,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:50,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:50,790 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 12:15:50,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:50,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:50,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:50,792 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 9 states. [2019-09-08 12:15:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:51,978 INFO L93 Difference]: Finished difference Result 808 states and 1065 transitions. [2019-09-08 12:15:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:51,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:15:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:51,983 INFO L225 Difference]: With dead ends: 808 [2019-09-08 12:15:51,983 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:15:51,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:15:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:15:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2019-09-08 12:15:52,017 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 83 [2019-09-08 12:15:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:52,018 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2019-09-08 12:15:52,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2019-09-08 12:15:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:52,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:52,019 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] [2019-09-08 12:15:52,020 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1331235743, now seen corresponding path program 1 times [2019-09-08 12:15:52,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:52,168 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 12:15:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:52,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:52,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:52,170 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand 9 states. [2019-09-08 12:15:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:53,681 INFO L93 Difference]: Finished difference Result 780 states and 1024 transitions. [2019-09-08 12:15:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:53,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:15:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:53,685 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:15:53,685 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:15:53,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:15:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:15:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2019-09-08 12:15:53,730 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 83 [2019-09-08 12:15:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:53,731 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2019-09-08 12:15:53,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2019-09-08 12:15:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:53,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:53,733 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] [2019-09-08 12:15:53,733 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:53,734 INFO L82 PathProgramCache]: Analyzing trace with hash 11721297, now seen corresponding path program 1 times [2019-09-08 12:15:53,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:53,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:53,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:53,915 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 12:15:53,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:53,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:53,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:53,919 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand 9 states. [2019-09-08 12:15:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:55,564 INFO L93 Difference]: Finished difference Result 839 states and 1106 transitions. [2019-09-08 12:15:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:55,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:15:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:55,568 INFO L225 Difference]: With dead ends: 839 [2019-09-08 12:15:55,568 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:15:55,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:15:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:15:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2019-09-08 12:15:55,610 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 83 [2019-09-08 12:15:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:55,611 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2019-09-08 12:15:55,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2019-09-08 12:15:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:55,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:55,612 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] [2019-09-08 12:15:55,613 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 116579511, now seen corresponding path program 1 times [2019-09-08 12:15:55,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:55,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:55,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:55,768 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 12:15:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:55,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:55,770 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand 9 states. [2019-09-08 12:15:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:57,034 INFO L93 Difference]: Finished difference Result 716 states and 926 transitions. [2019-09-08 12:15:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:57,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:15:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:57,037 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:15:57,037 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:15:57,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:15:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:15:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2019-09-08 12:15:57,078 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 83 [2019-09-08 12:15:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:57,079 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2019-09-08 12:15:57,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2019-09-08 12:15:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:57,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:57,081 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] [2019-09-08 12:15:57,081 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2029458257, now seen corresponding path program 1 times [2019-09-08 12:15:57,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:57,295 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 12:15:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:57,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:57,297 INFO L87 Difference]: Start difference. First operand 394 states and 494 transitions. Second operand 9 states. [2019-09-08 12:15:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:58,770 INFO L93 Difference]: Finished difference Result 777 states and 1018 transitions. [2019-09-08 12:15:58,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:15:58,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:15:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:58,774 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:15:58,775 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:15:58,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:15:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:15:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:15:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:15:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2019-09-08 12:15:58,816 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 83 [2019-09-08 12:15:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:58,816 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2019-09-08 12:15:58,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:15:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2019-09-08 12:15:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:15:58,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:58,818 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] [2019-09-08 12:15:58,819 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2037194958, now seen corresponding path program 1 times [2019-09-08 12:15:58,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:58,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:58,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:59,007 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 12:15:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:59,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:15:59,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:15:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:15:59,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:15:59,009 INFO L87 Difference]: Start difference. First operand 394 states and 493 transitions. Second operand 9 states. [2019-09-08 12:16:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:00,591 INFO L93 Difference]: Finished difference Result 716 states and 924 transitions. [2019-09-08 12:16:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:00,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:00,597 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:16:00,597 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:00,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2019-09-08 12:16:00,628 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 83 [2019-09-08 12:16:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:00,628 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2019-09-08 12:16:00,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2019-09-08 12:16:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:00,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:00,630 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] [2019-09-08 12:16:00,630 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash -315572149, now seen corresponding path program 1 times [2019-09-08 12:16:00,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:00,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:00,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:00,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:00,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:00,787 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 12:16:00,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:00,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:00,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:00,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:00,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:00,789 INFO L87 Difference]: Start difference. First operand 394 states and 492 transitions. Second operand 9 states. [2019-09-08 12:16:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:02,141 INFO L93 Difference]: Finished difference Result 716 states and 922 transitions. [2019-09-08 12:16:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:02,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:02,145 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:16:02,145 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:02,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2019-09-08 12:16:02,190 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 83 [2019-09-08 12:16:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:02,191 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2019-09-08 12:16:02,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2019-09-08 12:16:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:02,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:02,192 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] [2019-09-08 12:16:02,193 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash -697978443, now seen corresponding path program 1 times [2019-09-08 12:16:02,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:02,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:02,387 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 12:16:02,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:02,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:02,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:02,391 INFO L87 Difference]: Start difference. First operand 394 states and 491 transitions. Second operand 9 states. [2019-09-08 12:16:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:03,946 INFO L93 Difference]: Finished difference Result 777 states and 1013 transitions. [2019-09-08 12:16:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:03,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:03,950 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:16:03,950 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:03,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2019-09-08 12:16:03,995 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 83 [2019-09-08 12:16:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:03,995 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2019-09-08 12:16:03,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2019-09-08 12:16:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:03,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:03,997 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] [2019-09-08 12:16:03,998 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1927606278, now seen corresponding path program 1 times [2019-09-08 12:16:03,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:04,163 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 12:16:04,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:04,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:04,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:04,165 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand 9 states. [2019-09-08 12:16:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:05,659 INFO L93 Difference]: Finished difference Result 777 states and 1012 transitions. [2019-09-08 12:16:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:05,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:05,663 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:16:05,663 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:05,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2019-09-08 12:16:05,708 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 83 [2019-09-08 12:16:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:05,708 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2019-09-08 12:16:05,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2019-09-08 12:16:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:05,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:05,710 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] [2019-09-08 12:16:05,710 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash 416569401, now seen corresponding path program 1 times [2019-09-08 12:16:05,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:05,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:05,856 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 12:16:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:05,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:05,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:05,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:05,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:05,857 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 9 states. [2019-09-08 12:16:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:07,278 INFO L93 Difference]: Finished difference Result 780 states and 1013 transitions. [2019-09-08 12:16:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:07,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:07,283 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:16:07,283 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:07,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 488 transitions. [2019-09-08 12:16:07,328 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 488 transitions. Word has length 83 [2019-09-08 12:16:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:07,328 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 488 transitions. [2019-09-08 12:16:07,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 488 transitions. [2019-09-08 12:16:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:07,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:07,330 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] [2019-09-08 12:16:07,330 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -961144879, now seen corresponding path program 1 times [2019-09-08 12:16:07,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:07,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:07,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:07,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 12:16:07,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:07,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:07,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:07,488 INFO L87 Difference]: Start difference. First operand 394 states and 488 transitions. Second operand 9 states. [2019-09-08 12:16:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:08,865 INFO L93 Difference]: Finished difference Result 808 states and 1051 transitions. [2019-09-08 12:16:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:08,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:08,868 INFO L225 Difference]: With dead ends: 808 [2019-09-08 12:16:08,868 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:16:08,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:16:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:16:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 487 transitions. [2019-09-08 12:16:08,900 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 487 transitions. Word has length 83 [2019-09-08 12:16:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:08,901 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 487 transitions. [2019-09-08 12:16:08,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 487 transitions. [2019-09-08 12:16:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:08,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:08,902 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] [2019-09-08 12:16:08,903 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1104924732, now seen corresponding path program 1 times [2019-09-08 12:16:08,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:08,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:08,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:08,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:09,045 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 12:16:09,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:09,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:09,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:09,047 INFO L87 Difference]: Start difference. First operand 394 states and 487 transitions. Second operand 9 states. [2019-09-08 12:16:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:10,536 INFO L93 Difference]: Finished difference Result 780 states and 1011 transitions. [2019-09-08 12:16:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:10,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:10,539 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:16:10,539 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:10,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2019-09-08 12:16:10,577 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 83 [2019-09-08 12:16:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:10,577 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2019-09-08 12:16:10,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2019-09-08 12:16:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:16:10,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:10,578 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] [2019-09-08 12:16:10,579 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831093, now seen corresponding path program 1 times [2019-09-08 12:16:10,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:10,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:10,789 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 12:16:10,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:10,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:10,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:10,791 INFO L87 Difference]: Start difference. First operand 394 states and 486 transitions. Second operand 9 states. [2019-09-08 12:16:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:12,267 INFO L93 Difference]: Finished difference Result 777 states and 1006 transitions. [2019-09-08 12:16:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:12,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:16:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:12,270 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:16:12,270 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:16:12,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:16:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:16:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:16:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2019-09-08 12:16:12,309 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 83 [2019-09-08 12:16:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:12,310 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2019-09-08 12:16:12,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2019-09-08 12:16:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:16:12,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:12,311 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] [2019-09-08 12:16:12,312 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:12,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1207818414, now seen corresponding path program 1 times [2019-09-08 12:16:12,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:12,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:12,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:12,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:12,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:12,448 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 12:16:12,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:12,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:16:12,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:16:12,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:16:12,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:16:12,450 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand 9 states. [2019-09-08 12:16:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:13,864 INFO L93 Difference]: Finished difference Result 775 states and 1003 transitions. [2019-09-08 12:16:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:16:13,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:16:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:13,872 INFO L225 Difference]: With dead ends: 775 [2019-09-08 12:16:13,872 INFO L226 Difference]: Without dead ends: 710 [2019-09-08 12:16:13,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:16:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-08 12:16:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 393. [2019-09-08 12:16:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-08 12:16:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 483 transitions. [2019-09-08 12:16:13,921 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 483 transitions. Word has length 84 [2019-09-08 12:16:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:13,921 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 483 transitions. [2019-09-08 12:16:13,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:16:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 483 transitions. [2019-09-08 12:16:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:13,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:13,923 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] [2019-09-08 12:16:13,923 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1370154188, now seen corresponding path program 1 times [2019-09-08 12:16:13,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:13,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:13,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:15,008 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:16:15,943 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 12:16:15,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:15,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:16:15,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:16:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:16:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:16:15,945 INFO L87 Difference]: Start difference. First operand 393 states and 483 transitions. Second operand 26 states. [2019-09-08 12:16:16,103 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:16:17,058 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:16:17,287 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-08 12:16:17,577 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 12:16:17,941 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-08 12:16:18,154 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:16:18,363 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:16:18,595 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 12:16:22,551 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-08 12:16:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:23,526 INFO L93 Difference]: Finished difference Result 827 states and 1034 transitions. [2019-09-08 12:16:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:16:23,526 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2019-09-08 12:16:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:23,531 INFO L225 Difference]: With dead ends: 827 [2019-09-08 12:16:23,531 INFO L226 Difference]: Without dead ends: 759 [2019-09-08 12:16:23,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:16:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-08 12:16:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 413. [2019-09-08 12:16:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-08 12:16:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 510 transitions. [2019-09-08 12:16:23,598 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 510 transitions. Word has length 85 [2019-09-08 12:16:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:23,598 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 510 transitions. [2019-09-08 12:16:23,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:16:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 510 transitions. [2019-09-08 12:16:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:23,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:23,600 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] [2019-09-08 12:16:23,601 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash -230689484, now seen corresponding path program 1 times [2019-09-08 12:16:23,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:23,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:23,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:23,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:24,394 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 12:16:24,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:24,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:16:24,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:16:24,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:16:24,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:16:24,396 INFO L87 Difference]: Start difference. First operand 413 states and 510 transitions. Second operand 17 states. [2019-09-08 12:16:24,992 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:16:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:27,149 INFO L93 Difference]: Finished difference Result 885 states and 1144 transitions. [2019-09-08 12:16:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:16:27,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:16:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:27,154 INFO L225 Difference]: With dead ends: 885 [2019-09-08 12:16:27,154 INFO L226 Difference]: Without dead ends: 792 [2019-09-08 12:16:27,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:16:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-08 12:16:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 402. [2019-09-08 12:16:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-08 12:16:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 495 transitions. [2019-09-08 12:16:27,234 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 495 transitions. Word has length 85 [2019-09-08 12:16:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:27,234 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 495 transitions. [2019-09-08 12:16:27,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 495 transitions. [2019-09-08 12:16:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:27,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:27,236 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] [2019-09-08 12:16:27,236 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1185402698, now seen corresponding path program 1 times [2019-09-08 12:16:27,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:27,995 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 12:16:27,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:27,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:16:27,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:16:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:16:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:16:27,996 INFO L87 Difference]: Start difference. First operand 402 states and 495 transitions. Second operand 16 states. [2019-09-08 12:16:28,630 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 12:16:28,771 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:16:28,940 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:16:29,108 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:16:29,262 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:16:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:31,355 INFO L93 Difference]: Finished difference Result 702 states and 847 transitions. [2019-09-08 12:16:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:16:31,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2019-09-08 12:16:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:31,360 INFO L225 Difference]: With dead ends: 702 [2019-09-08 12:16:31,360 INFO L226 Difference]: Without dead ends: 698 [2019-09-08 12:16:31,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:16:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-08 12:16:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 419. [2019-09-08 12:16:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-08 12:16:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 519 transitions. [2019-09-08 12:16:31,439 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 519 transitions. Word has length 85 [2019-09-08 12:16:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:31,440 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 519 transitions. [2019-09-08 12:16:31,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:16:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 519 transitions. [2019-09-08 12:16:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:31,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:31,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:31,442 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1294662844, now seen corresponding path program 1 times [2019-09-08 12:16:31,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:31,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:31,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:32,145 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 12:16:32,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:32,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:16:32,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:16:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:16:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:16:32,146 INFO L87 Difference]: Start difference. First operand 419 states and 519 transitions. Second operand 17 states. [2019-09-08 12:16:32,688 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:16:32,827 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:16:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:34,411 INFO L93 Difference]: Finished difference Result 878 states and 1135 transitions. [2019-09-08 12:16:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:16:34,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:16:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:34,414 INFO L225 Difference]: With dead ends: 878 [2019-09-08 12:16:34,414 INFO L226 Difference]: Without dead ends: 743 [2019-09-08 12:16:34,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:16:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-09-08 12:16:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 395. [2019-09-08 12:16:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-08 12:16:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 486 transitions. [2019-09-08 12:16:34,473 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 486 transitions. Word has length 85 [2019-09-08 12:16:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:34,474 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 486 transitions. [2019-09-08 12:16:34,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 486 transitions. [2019-09-08 12:16:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:34,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:34,475 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] [2019-09-08 12:16:34,475 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash 181793350, now seen corresponding path program 1 times [2019-09-08 12:16:34,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:34,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:34,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:36,418 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 12:16:36,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:36,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:16:36,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:16:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:16:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:16:36,420 INFO L87 Difference]: Start difference. First operand 395 states and 486 transitions. Second operand 27 states. [2019-09-08 12:16:36,573 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 12:16:37,424 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:16:37,848 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 12:16:38,199 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 12:16:38,582 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 12:16:39,015 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-08 12:16:39,223 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:16:39,470 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 12:16:39,682 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 12:16:39,924 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:16:40,153 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:16:40,498 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:16:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:44,326 INFO L93 Difference]: Finished difference Result 743 states and 930 transitions. [2019-09-08 12:16:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:16:44,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2019-09-08 12:16:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:44,330 INFO L225 Difference]: With dead ends: 743 [2019-09-08 12:16:44,330 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 12:16:44,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:16:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 12:16:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 406. [2019-09-08 12:16:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-09-08 12:16:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 498 transitions. [2019-09-08 12:16:44,389 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 498 transitions. Word has length 85 [2019-09-08 12:16:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:44,390 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 498 transitions. [2019-09-08 12:16:44,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:16:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 498 transitions. [2019-09-08 12:16:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:44,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:44,391 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] [2019-09-08 12:16:44,391 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 151515162, now seen corresponding path program 1 times [2019-09-08 12:16:44,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:44,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:45,105 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 12:16:45,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:45,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:16:45,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:16:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:16:45,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:16:45,106 INFO L87 Difference]: Start difference. First operand 406 states and 498 transitions. Second operand 17 states. [2019-09-08 12:16:45,653 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:16:45,799 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:16:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:47,122 INFO L93 Difference]: Finished difference Result 836 states and 1081 transitions. [2019-09-08 12:16:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:16:47,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:16:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:47,126 INFO L225 Difference]: With dead ends: 836 [2019-09-08 12:16:47,126 INFO L226 Difference]: Without dead ends: 722 [2019-09-08 12:16:47,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:16:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-08 12:16:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 377. [2019-09-08 12:16:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:16:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 460 transitions. [2019-09-08 12:16:47,186 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 460 transitions. Word has length 85 [2019-09-08 12:16:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:47,186 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 460 transitions. [2019-09-08 12:16:47,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 460 transitions. [2019-09-08 12:16:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:47,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:47,188 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] [2019-09-08 12:16:47,188 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 626554292, now seen corresponding path program 1 times [2019-09-08 12:16:47,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:47,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:16:47,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:16:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:16:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:16:47,977 INFO L87 Difference]: Start difference. First operand 377 states and 460 transitions. Second operand 17 states. [2019-09-08 12:16:48,596 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:16:48,760 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:16:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:50,912 INFO L93 Difference]: Finished difference Result 767 states and 993 transitions. [2019-09-08 12:16:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:16:50,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:16:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:50,915 INFO L225 Difference]: With dead ends: 767 [2019-09-08 12:16:50,916 INFO L226 Difference]: Without dead ends: 696 [2019-09-08 12:16:50,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:16:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-08 12:16:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 376. [2019-09-08 12:16:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-08 12:16:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 457 transitions. [2019-09-08 12:16:50,975 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 457 transitions. Word has length 85 [2019-09-08 12:16:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:50,976 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 457 transitions. [2019-09-08 12:16:50,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 457 transitions. [2019-09-08 12:16:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:50,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:50,977 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] [2019-09-08 12:16:50,978 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1764599692, now seen corresponding path program 1 times [2019-09-08 12:16:50,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:50,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:50,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:50,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:51,753 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:16:52,407 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 12:16:52,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:52,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:16:52,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:16:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:16:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:16:52,408 INFO L87 Difference]: Start difference. First operand 376 states and 457 transitions. Second operand 25 states. [2019-09-08 12:16:52,541 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:16:53,374 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:16:53,658 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-08 12:16:53,948 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-08 12:16:54,268 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-08 12:16:54,462 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:16:54,660 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:16:54,851 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:16:55,010 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:16:55,184 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:16:55,446 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:16:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:58,775 INFO L93 Difference]: Finished difference Result 784 states and 986 transitions. [2019-09-08 12:16:58,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:16:58,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-09-08 12:16:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:58,779 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:16:58,779 INFO L226 Difference]: Without dead ends: 692 [2019-09-08 12:16:58,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:16:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-08 12:16:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 387. [2019-09-08 12:16:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-08 12:16:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 469 transitions. [2019-09-08 12:16:58,878 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 469 transitions. Word has length 85 [2019-09-08 12:16:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:58,878 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 469 transitions. [2019-09-08 12:16:58,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:16:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 469 transitions. [2019-09-08 12:16:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:16:58,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:58,880 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] [2019-09-08 12:16:58,880 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1793652703, now seen corresponding path program 1 times [2019-09-08 12:16:58,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:58,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:58,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:59,420 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 12:16:59,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:59,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:16:59,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:16:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:16:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:16:59,421 INFO L87 Difference]: Start difference. First operand 387 states and 469 transitions. Second operand 15 states. [2019-09-08 12:17:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:01,204 INFO L93 Difference]: Finished difference Result 807 states and 1034 transitions. [2019-09-08 12:17:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:17:01,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-08 12:17:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:01,207 INFO L225 Difference]: With dead ends: 807 [2019-09-08 12:17:01,207 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 12:17:01,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:17:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 12:17:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 346. [2019-09-08 12:17:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 12:17:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 420 transitions. [2019-09-08 12:17:01,272 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 420 transitions. Word has length 85 [2019-09-08 12:17:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:01,272 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 420 transitions. [2019-09-08 12:17:01,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:17:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 420 transitions. [2019-09-08 12:17:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:01,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:01,273 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] [2019-09-08 12:17:01,273 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2017902633, now seen corresponding path program 1 times [2019-09-08 12:17:01,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:01,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:01,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:01,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:01,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:01,424 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 12:17:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:01,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:01,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:01,426 INFO L87 Difference]: Start difference. First operand 346 states and 420 transitions. Second operand 9 states. [2019-09-08 12:17:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:02,415 INFO L93 Difference]: Finished difference Result 699 states and 910 transitions. [2019-09-08 12:17:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:17:02,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:17:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:02,417 INFO L225 Difference]: With dead ends: 699 [2019-09-08 12:17:02,417 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 12:17:02,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:17:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 12:17:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 346. [2019-09-08 12:17:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 12:17:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 418 transitions. [2019-09-08 12:17:02,475 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 418 transitions. Word has length 86 [2019-09-08 12:17:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:02,475 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 418 transitions. [2019-09-08 12:17:02,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:17:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 418 transitions. [2019-09-08 12:17:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:02,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:02,477 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] [2019-09-08 12:17:02,477 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:02,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1859590783, now seen corresponding path program 1 times [2019-09-08 12:17:02,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:02,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:02,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:02,620 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 12:17:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:02,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:02,621 INFO L87 Difference]: Start difference. First operand 346 states and 418 transitions. Second operand 9 states. [2019-09-08 12:17:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:03,781 INFO L93 Difference]: Finished difference Result 623 states and 796 transitions. [2019-09-08 12:17:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:17:03,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:17:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:03,783 INFO L225 Difference]: With dead ends: 623 [2019-09-08 12:17:03,783 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 12:17:03,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:17:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 12:17:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 346. [2019-09-08 12:17:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 12:17:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 416 transitions. [2019-09-08 12:17:03,863 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 416 transitions. Word has length 86 [2019-09-08 12:17:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:03,863 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 416 transitions. [2019-09-08 12:17:03,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:17:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 416 transitions. [2019-09-08 12:17:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:03,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:03,864 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] [2019-09-08 12:17:03,864 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 163610703, now seen corresponding path program 1 times [2019-09-08 12:17:03,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:03,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:04,278 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 12:17:04,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:17:04,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:17:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:17:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:17:04,280 INFO L87 Difference]: Start difference. First operand 346 states and 416 transitions. Second operand 12 states. [2019-09-08 12:17:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:05,547 INFO L93 Difference]: Finished difference Result 859 states and 1132 transitions. [2019-09-08 12:17:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:17:05,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-08 12:17:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:05,549 INFO L225 Difference]: With dead ends: 859 [2019-09-08 12:17:05,549 INFO L226 Difference]: Without dead ends: 773 [2019-09-08 12:17:05,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:17:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-08 12:17:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 324. [2019-09-08 12:17:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-08 12:17:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 391 transitions. [2019-09-08 12:17:05,610 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 391 transitions. Word has length 86 [2019-09-08 12:17:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:05,610 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 391 transitions. [2019-09-08 12:17:05,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:17:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 391 transitions. [2019-09-08 12:17:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:05,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:05,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:05,611 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 28003791, now seen corresponding path program 1 times [2019-09-08 12:17:05,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:05,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:05,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:06,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:06,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:17:06,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:17:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:17:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:17:06,226 INFO L87 Difference]: Start difference. First operand 324 states and 391 transitions. Second operand 16 states. [2019-09-08 12:17:07,282 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:17:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:08,695 INFO L93 Difference]: Finished difference Result 833 states and 1102 transitions. [2019-09-08 12:17:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:17:08,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:17:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:08,697 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:17:08,697 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 12:17:08,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:17:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 12:17:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 330. [2019-09-08 12:17:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 12:17:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 398 transitions. [2019-09-08 12:17:08,762 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 398 transitions. Word has length 86 [2019-09-08 12:17:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:08,762 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 398 transitions. [2019-09-08 12:17:08,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:17:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 398 transitions. [2019-09-08 12:17:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:08,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:08,763 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] [2019-09-08 12:17:08,763 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 676927323, now seen corresponding path program 1 times [2019-09-08 12:17:08,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:08,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:08,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:08,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:09,415 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 12:17:09,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:17:09,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:17:09,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:17:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:17:09,418 INFO L87 Difference]: Start difference. First operand 330 states and 398 transitions. Second operand 16 states. [2019-09-08 12:17:10,367 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:17:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:11,262 INFO L93 Difference]: Finished difference Result 547 states and 688 transitions. [2019-09-08 12:17:11,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:17:11,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:17:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:11,264 INFO L225 Difference]: With dead ends: 547 [2019-09-08 12:17:11,264 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 12:17:11,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:17:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 12:17:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 319. [2019-09-08 12:17:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:17:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-08 12:17:11,333 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 86 [2019-09-08 12:17:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:11,333 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-08 12:17:11,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:17:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-08 12:17:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:11,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:11,334 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] [2019-09-08 12:17:11,335 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1971516155, now seen corresponding path program 1 times [2019-09-08 12:17:11,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:11,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:11,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 12:17:11,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:11,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:17:11,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:17:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:17:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:17:11,998 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 16 states. [2019-09-08 12:17:12,603 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:17:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:14,162 INFO L93 Difference]: Finished difference Result 572 states and 712 transitions. [2019-09-08 12:17:14,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:17:14,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:17:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:14,163 INFO L225 Difference]: With dead ends: 572 [2019-09-08 12:17:14,163 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:17:14,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:17:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:17:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 319. [2019-09-08 12:17:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:17:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-08 12:17:14,227 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 86 [2019-09-08 12:17:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:14,227 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-08 12:17:14,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:17:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-08 12:17:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:14,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:14,229 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] [2019-09-08 12:17:14,229 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1312927659, now seen corresponding path program 1 times [2019-09-08 12:17:14,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:14,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:14,633 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 12:17:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:17:14,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:17:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:17:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:17:14,634 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 12 states. [2019-09-08 12:17:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:15,887 INFO L93 Difference]: Finished difference Result 533 states and 667 transitions. [2019-09-08 12:17:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:17:15,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-08 12:17:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:15,889 INFO L225 Difference]: With dead ends: 533 [2019-09-08 12:17:15,889 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 12:17:15,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:17:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 12:17:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 315. [2019-09-08 12:17:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 12:17:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 379 transitions. [2019-09-08 12:17:15,952 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 379 transitions. Word has length 86 [2019-09-08 12:17:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 379 transitions. [2019-09-08 12:17:15,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:17:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 379 transitions. [2019-09-08 12:17:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:15,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:15,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:15,954 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1341980670, now seen corresponding path program 1 times [2019-09-08 12:17:15,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:15,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:16,572 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 12:17:16,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:16,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:17:16,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:17:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:17:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:17:16,573 INFO L87 Difference]: Start difference. First operand 315 states and 379 transitions. Second operand 17 states. [2019-09-08 12:17:16,709 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-08 12:17:17,384 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-08 12:17:17,550 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:17:17,710 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:17:17,886 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:17:18,064 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 12:17:18,292 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:17:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:19,960 INFO L93 Difference]: Finished difference Result 1091 states and 1479 transitions. [2019-09-08 12:17:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:17:19,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:17:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:19,964 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 12:17:19,964 INFO L226 Difference]: Without dead ends: 1003 [2019-09-08 12:17:19,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:17:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-08 12:17:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 291. [2019-09-08 12:17:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-08 12:17:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2019-09-08 12:17:20,032 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 86 [2019-09-08 12:17:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:20,032 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2019-09-08 12:17:20,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:17:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2019-09-08 12:17:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:17:20,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:20,033 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] [2019-09-08 12:17:20,033 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 151346387, now seen corresponding path program 1 times [2019-09-08 12:17:20,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:20,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:20,731 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 12:17:20,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:20,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:17:20,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:17:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:17:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:17:20,732 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand 15 states. [2019-09-08 12:17:20,918 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:17:21,267 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:17:21,491 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:17:21,754 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:17:21,971 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:17:22,202 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:17:22,429 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:17:22,822 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-08 12:17:23,334 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-08 12:17:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:25,160 INFO L93 Difference]: Finished difference Result 1077 states and 1458 transitions. [2019-09-08 12:17:25,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:17:25,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-08 12:17:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:25,163 INFO L225 Difference]: With dead ends: 1077 [2019-09-08 12:17:25,163 INFO L226 Difference]: Without dead ends: 993 [2019-09-08 12:17:25,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:17:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-08 12:17:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 254. [2019-09-08 12:17:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-08 12:17:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2019-09-08 12:17:25,229 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 86 [2019-09-08 12:17:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:25,229 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2019-09-08 12:17:25,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:17:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2019-09-08 12:17:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:17:25,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:25,229 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] [2019-09-08 12:17:25,230 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 470342809, now seen corresponding path program 1 times [2019-09-08 12:17:25,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:25,387 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 12:17:25,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:25,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:25,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:25,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:25,389 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand 9 states. [2019-09-08 12:17:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:26,196 INFO L93 Difference]: Finished difference Result 384 states and 470 transitions. [2019-09-08 12:17:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:17:26,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:17:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:26,198 INFO L225 Difference]: With dead ends: 384 [2019-09-08 12:17:26,198 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:17:26,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:17:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:17:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 254. [2019-09-08 12:17:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-08 12:17:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 302 transitions. [2019-09-08 12:17:26,294 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 302 transitions. Word has length 87 [2019-09-08 12:17:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:26,294 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 302 transitions. [2019-09-08 12:17:26,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:17:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 302 transitions. [2019-09-08 12:17:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:17:26,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:26,295 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] [2019-09-08 12:17:26,295 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1658746276, now seen corresponding path program 1 times [2019-09-08 12:17:26,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:26,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:26,648 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 12:17:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:26,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:17:26,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:17:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:17:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:17:26,649 INFO L87 Difference]: Start difference. First operand 254 states and 302 transitions. Second operand 9 states. [2019-09-08 12:17:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:27,249 INFO L93 Difference]: Finished difference Result 579 states and 752 transitions. [2019-09-08 12:17:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:27,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:17:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:27,251 INFO L225 Difference]: With dead ends: 579 [2019-09-08 12:17:27,251 INFO L226 Difference]: Without dead ends: 475 [2019-09-08 12:17:27,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:17:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-08 12:17:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 214. [2019-09-08 12:17:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 12:17:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 257 transitions. [2019-09-08 12:17:27,305 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 257 transitions. Word has length 87 [2019-09-08 12:17:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:27,305 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 257 transitions. [2019-09-08 12:17:27,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:17:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 257 transitions. [2019-09-08 12:17:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:17:27,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:27,306 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] [2019-09-08 12:17:27,306 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -266310598, now seen corresponding path program 1 times [2019-09-08 12:17:27,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:27,992 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 12:17:27,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:27,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:17:27,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:17:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:17:27,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:17:27,994 INFO L87 Difference]: Start difference. First operand 214 states and 257 transitions. Second operand 13 states. [2019-09-08 12:17:28,142 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-09-08 12:17:28,563 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-09-08 12:17:28,767 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:17:28,956 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:17:29,216 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 12:17:29,454 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-09-08 12:17:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:30,120 INFO L93 Difference]: Finished difference Result 627 states and 837 transitions. [2019-09-08 12:17:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:17:30,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-08 12:17:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:30,122 INFO L225 Difference]: With dead ends: 627 [2019-09-08 12:17:30,123 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 12:17:30,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:17:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 12:17:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 164. [2019-09-08 12:17:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-08 12:17:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2019-09-08 12:17:30,207 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 87 [2019-09-08 12:17:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:30,208 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2019-09-08 12:17:30,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:17:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2019-09-08 12:17:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:17:30,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:30,209 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] [2019-09-08 12:17:30,209 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1545293458, now seen corresponding path program 1 times [2019-09-08 12:17:30,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:30,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:30,948 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 12:17:30,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:30,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:17:30,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:17:30,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:17:30,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:17:30,949 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 16 states. [2019-09-08 12:17:31,710 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 12:17:31,872 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:17:32,025 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:17:32,170 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 12:17:32,389 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-08 12:17:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:33,385 INFO L93 Difference]: Finished difference Result 565 states and 767 transitions. [2019-09-08 12:17:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:17:33,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:17:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:33,387 INFO L225 Difference]: With dead ends: 565 [2019-09-08 12:17:33,388 INFO L226 Difference]: Without dead ends: 559 [2019-09-08 12:17:33,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:17:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-08 12:17:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 188. [2019-09-08 12:17:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-08 12:17:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2019-09-08 12:17:33,471 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 88 [2019-09-08 12:17:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:33,472 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2019-09-08 12:17:33,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:17:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2019-09-08 12:17:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:17:33,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:33,473 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] [2019-09-08 12:17:33,473 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1695614251, now seen corresponding path program 1 times [2019-09-08 12:17:33,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:33,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:33,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:33,860 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 12:17:33,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:33,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:17:33,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:17:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:17:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:17:33,861 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 12 states. [2019-09-08 12:17:34,266 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:17:34,386 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:17:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:35,349 INFO L93 Difference]: Finished difference Result 547 states and 749 transitions. [2019-09-08 12:17:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:17:35,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-08 12:17:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:35,351 INFO L225 Difference]: With dead ends: 547 [2019-09-08 12:17:35,351 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 12:17:35,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:17:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 12:17:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 158. [2019-09-08 12:17:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-08 12:17:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 195 transitions. [2019-09-08 12:17:35,437 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 195 transitions. Word has length 89 [2019-09-08 12:17:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:35,438 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 195 transitions. [2019-09-08 12:17:35,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:17:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 195 transitions. [2019-09-08 12:17:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:17:35,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:35,439 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] [2019-09-08 12:17:35,439 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1499104933, now seen corresponding path program 1 times [2019-09-08 12:17:35,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:35,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:35,516 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 12:17:35,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:35,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:35,517 INFO L87 Difference]: Start difference. First operand 158 states and 195 transitions. Second operand 3 states. [2019-09-08 12:17:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:35,692 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2019-09-08 12:17:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:35,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 12:17:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:35,693 INFO L225 Difference]: With dead ends: 282 [2019-09-08 12:17:35,693 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 12:17:35,694 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 12:17:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 12:17:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2019-09-08 12:17:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-08 12:17:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2019-09-08 12:17:35,781 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 115 [2019-09-08 12:17:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:35,782 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2019-09-08 12:17:35,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2019-09-08 12:17:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:35,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:35,783 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] [2019-09-08 12:17:35,783 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash -527865099, now seen corresponding path program 1 times [2019-09-08 12:17:35,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:35,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:35,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:35,857 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 12:17:35,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:35,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:35,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:35,858 INFO L87 Difference]: Start difference. First operand 216 states and 280 transitions. Second operand 3 states. [2019-09-08 12:17:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:36,061 INFO L93 Difference]: Finished difference Result 450 states and 622 transitions. [2019-09-08 12:17:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:36,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 12:17:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:36,063 INFO L225 Difference]: With dead ends: 450 [2019-09-08 12:17:36,063 INFO L226 Difference]: Without dead ends: 328 [2019-09-08 12:17:36,064 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 12:17:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-08 12:17:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-09-08 12:17:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-08 12:17:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 435 transitions. [2019-09-08 12:17:36,257 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 435 transitions. Word has length 117 [2019-09-08 12:17:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:36,257 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 435 transitions. [2019-09-08 12:17:36,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2019-09-08 12:17:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:36,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:36,259 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] [2019-09-08 12:17:36,259 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -461371587, now seen corresponding path program 1 times [2019-09-08 12:17:36,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:36,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:36,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:36,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:36,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:36,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:36,332 INFO L87 Difference]: Start difference. First operand 324 states and 435 transitions. Second operand 3 states. [2019-09-08 12:17:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:36,610 INFO L93 Difference]: Finished difference Result 672 states and 941 transitions. [2019-09-08 12:17:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:36,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 12:17:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:36,611 INFO L225 Difference]: With dead ends: 672 [2019-09-08 12:17:36,611 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 12:17:36,612 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 12:17:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 12:17:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-09-08 12:17:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 12:17:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 603 transitions. [2019-09-08 12:17:36,838 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 603 transitions. Word has length 117 [2019-09-08 12:17:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:36,838 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 603 transitions. [2019-09-08 12:17:36,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 603 transitions. [2019-09-08 12:17:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:36,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:36,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:36,839 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1576522212, now seen corresponding path program 1 times [2019-09-08 12:17:36,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:36,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:36,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:36,934 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 12:17:36,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:36,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:17:36,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:17:36,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:17:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:36,935 INFO L87 Difference]: Start difference. First operand 440 states and 603 transitions. Second operand 7 states. [2019-09-08 12:17:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:38,623 INFO L93 Difference]: Finished difference Result 1860 states and 2651 transitions. [2019-09-08 12:17:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:38,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:17:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:38,628 INFO L225 Difference]: With dead ends: 1860 [2019-09-08 12:17:38,629 INFO L226 Difference]: Without dead ends: 1514 [2019-09-08 12:17:38,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:17:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-08 12:17:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 844. [2019-09-08 12:17:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-08 12:17:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1189 transitions. [2019-09-08 12:17:39,290 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1189 transitions. Word has length 117 [2019-09-08 12:17:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:39,290 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1189 transitions. [2019-09-08 12:17:39,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:17:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1189 transitions. [2019-09-08 12:17:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:39,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:39,292 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] [2019-09-08 12:17:39,292 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 298627100, now seen corresponding path program 1 times [2019-09-08 12:17:39,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:39,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:39,405 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 12:17:39,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:39,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:17:39,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:17:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:17:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:39,407 INFO L87 Difference]: Start difference. First operand 844 states and 1189 transitions. Second operand 7 states. [2019-09-08 12:17:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:41,439 INFO L93 Difference]: Finished difference Result 3432 states and 4937 transitions. [2019-09-08 12:17:41,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:41,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:17:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:41,442 INFO L225 Difference]: With dead ends: 3432 [2019-09-08 12:17:41,442 INFO L226 Difference]: Without dead ends: 2682 [2019-09-08 12:17:41,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:17:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-09-08 12:17:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1712. [2019-09-08 12:17:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-09-08 12:17:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2445 transitions. [2019-09-08 12:17:42,426 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2445 transitions. Word has length 117 [2019-09-08 12:17:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:42,426 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2445 transitions. [2019-09-08 12:17:42,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:17:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2445 transitions. [2019-09-08 12:17:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:42,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:42,427 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] [2019-09-08 12:17:42,428 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 662712860, now seen corresponding path program 1 times [2019-09-08 12:17:42,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:42,517 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 12:17:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:42,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:17:42,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:17:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:17:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:42,518 INFO L87 Difference]: Start difference. First operand 1712 states and 2445 transitions. Second operand 7 states. [2019-09-08 12:17:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:46,505 INFO L93 Difference]: Finished difference Result 7600 states and 10969 transitions. [2019-09-08 12:17:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:46,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:17:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:46,510 INFO L225 Difference]: With dead ends: 7600 [2019-09-08 12:17:46,510 INFO L226 Difference]: Without dead ends: 5982 [2019-09-08 12:17:46,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:17:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2019-09-08 12:17:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3568. [2019-09-08 12:17:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-09-08 12:17:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 5125 transitions. [2019-09-08 12:17:48,621 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 5125 transitions. Word has length 117 [2019-09-08 12:17:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:48,621 INFO L475 AbstractCegarLoop]: Abstraction has 3568 states and 5125 transitions. [2019-09-08 12:17:48,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:17:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 5125 transitions. [2019-09-08 12:17:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:17:48,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:48,623 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] [2019-09-08 12:17:48,623 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1403171868, now seen corresponding path program 1 times [2019-09-08 12:17:48,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:48,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:48,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:48,721 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 12:17:48,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:48,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:17:48,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:17:48,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:17:48,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:48,723 INFO L87 Difference]: Start difference. First operand 3568 states and 5125 transitions. Second operand 7 states. [2019-09-08 12:17:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:55,424 INFO L93 Difference]: Finished difference Result 13674 states and 19746 transitions. [2019-09-08 12:17:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:55,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:17:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:55,433 INFO L225 Difference]: With dead ends: 13674 [2019-09-08 12:17:55,434 INFO L226 Difference]: Without dead ends: 10200 [2019-09-08 12:17:55,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:17:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2019-09-08 12:17:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 5872. [2019-09-08 12:17:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-09-08 12:17:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 8453 transitions. [2019-09-08 12:17:58,987 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 8453 transitions. Word has length 117 [2019-09-08 12:17:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:58,987 INFO L475 AbstractCegarLoop]: Abstraction has 5872 states and 8453 transitions. [2019-09-08 12:17:58,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:17:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 8453 transitions. [2019-09-08 12:17:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:17:58,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:58,988 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] [2019-09-08 12:17:58,989 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1159936026, now seen corresponding path program 1 times [2019-09-08 12:17:58,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:58,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:59,065 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 12:17:59,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:17:59,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:17:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:17:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:17:59,066 INFO L87 Difference]: Start difference. First operand 5872 states and 8453 transitions. Second operand 7 states. [2019-09-08 12:18:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:07,852 INFO L93 Difference]: Finished difference Result 18136 states and 26057 transitions. [2019-09-08 12:18:07,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:18:07,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:18:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:07,866 INFO L225 Difference]: With dead ends: 18136 [2019-09-08 12:18:07,866 INFO L226 Difference]: Without dead ends: 12358 [2019-09-08 12:18:07,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:18:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12358 states. [2019-09-08 12:18:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12358 to 6968. [2019-09-08 12:18:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-09-08 12:18:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 9941 transitions. [2019-09-08 12:18:12,128 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 9941 transitions. Word has length 118 [2019-09-08 12:18:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:12,128 INFO L475 AbstractCegarLoop]: Abstraction has 6968 states and 9941 transitions. [2019-09-08 12:18:12,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:18:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 9941 transitions. [2019-09-08 12:18:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:18:12,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:12,131 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] [2019-09-08 12:18:12,132 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1593339123, now seen corresponding path program 1 times [2019-09-08 12:18:12,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:12,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:12,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:12,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:12,179 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 12:18:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:12,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:12,180 INFO L87 Difference]: Start difference. First operand 6968 states and 9941 transitions. Second operand 3 states. [2019-09-08 12:18:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:16,981 INFO L93 Difference]: Finished difference Result 14556 states and 20791 transitions. [2019-09-08 12:18:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:16,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:18:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:16,988 INFO L225 Difference]: With dead ends: 14556 [2019-09-08 12:18:16,989 INFO L226 Difference]: Without dead ends: 7682 [2019-09-08 12:18:16,996 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 12:18:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-09-08 12:18:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7584. [2019-09-08 12:18:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7584 states. [2019-09-08 12:18:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 10741 transitions. [2019-09-08 12:18:21,701 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 10741 transitions. Word has length 118 [2019-09-08 12:18:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:21,701 INFO L475 AbstractCegarLoop]: Abstraction has 7584 states and 10741 transitions. [2019-09-08 12:18:21,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 10741 transitions. [2019-09-08 12:18:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:18:21,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:21,704 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] [2019-09-08 12:18:21,704 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:21,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1861651787, now seen corresponding path program 1 times [2019-09-08 12:18:21,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:21,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:21,784 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 12:18:21,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:21,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:18:21,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:18:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:18:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:18:21,786 INFO L87 Difference]: Start difference. First operand 7584 states and 10741 transitions. Second operand 6 states. [2019-09-08 12:18:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:29,762 INFO L93 Difference]: Finished difference Result 12088 states and 16868 transitions. [2019-09-08 12:18:29,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:18:29,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 12:18:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:29,776 INFO L225 Difference]: With dead ends: 12088 [2019-09-08 12:18:29,776 INFO L226 Difference]: Without dead ends: 12086 [2019-09-08 12:18:29,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12086 states. [2019-09-08 12:18:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12086 to 7680. [2019-09-08 12:18:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7680 states. [2019-09-08 12:18:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7680 states to 7680 states and 10805 transitions. [2019-09-08 12:18:34,570 INFO L78 Accepts]: Start accepts. Automaton has 7680 states and 10805 transitions. Word has length 118 [2019-09-08 12:18:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:34,570 INFO L475 AbstractCegarLoop]: Abstraction has 7680 states and 10805 transitions. [2019-09-08 12:18:34,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:18:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7680 states and 10805 transitions. [2019-09-08 12:18:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:18:34,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:34,571 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] [2019-09-08 12:18:34,572 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598154, now seen corresponding path program 1 times [2019-09-08 12:18:34,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:34,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:34,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:34,640 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 12:18:34,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:34,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:34,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:34,643 INFO L87 Difference]: Start difference. First operand 7680 states and 10805 transitions. Second operand 3 states. [2019-09-08 12:18:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:39,347 INFO L93 Difference]: Finished difference Result 14812 states and 20823 transitions. [2019-09-08 12:18:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:39,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 12:18:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:39,354 INFO L225 Difference]: With dead ends: 14812 [2019-09-08 12:18:39,355 INFO L226 Difference]: Without dead ends: 7226 [2019-09-08 12:18:39,362 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 12:18:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7226 states. [2019-09-08 12:18:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7226 to 6432. [2019-09-08 12:18:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-09-08 12:18:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 8965 transitions. [2019-09-08 12:18:43,435 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 8965 transitions. Word has length 119 [2019-09-08 12:18:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:43,435 INFO L475 AbstractCegarLoop]: Abstraction has 6432 states and 8965 transitions. [2019-09-08 12:18:43,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 8965 transitions. [2019-09-08 12:18:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:18:43,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:43,437 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] [2019-09-08 12:18:43,437 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash -45815035, now seen corresponding path program 1 times [2019-09-08 12:18:43,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:43,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:43,506 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 12:18:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:43,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:43,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:43,508 INFO L87 Difference]: Start difference. First operand 6432 states and 8965 transitions. Second operand 3 states. [2019-09-08 12:18:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:47,596 INFO L93 Difference]: Finished difference Result 12316 states and 17147 transitions. [2019-09-08 12:18:47,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:47,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:18:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:47,602 INFO L225 Difference]: With dead ends: 12316 [2019-09-08 12:18:47,602 INFO L226 Difference]: Without dead ends: 5978 [2019-09-08 12:18:47,610 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 12:18:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2019-09-08 12:18:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 4563. [2019-09-08 12:18:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-09-08 12:18:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6255 transitions. [2019-09-08 12:18:50,718 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6255 transitions. Word has length 120 [2019-09-08 12:18:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:50,718 INFO L475 AbstractCegarLoop]: Abstraction has 4563 states and 6255 transitions. [2019-09-08 12:18:50,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6255 transitions. [2019-09-08 12:18:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:18:50,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:50,719 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] [2019-09-08 12:18:50,720 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash -686485906, now seen corresponding path program 1 times [2019-09-08 12:18:50,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:50,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:50,773 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 12:18:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:50,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:50,774 INFO L87 Difference]: Start difference. First operand 4563 states and 6255 transitions. Second operand 3 states. [2019-09-08 12:18:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:55,715 INFO L93 Difference]: Finished difference Result 11671 states and 16046 transitions. [2019-09-08 12:18:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:55,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:18:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:55,721 INFO L225 Difference]: With dead ends: 11671 [2019-09-08 12:18:55,721 INFO L226 Difference]: Without dead ends: 7202 [2019-09-08 12:18:55,727 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 12:18:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7202 states. [2019-09-08 12:19:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7202 to 6744. [2019-09-08 12:19:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-09-08 12:19:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 9244 transitions. [2019-09-08 12:19:00,312 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 9244 transitions. Word has length 121 [2019-09-08 12:19:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:00,312 INFO L475 AbstractCegarLoop]: Abstraction has 6744 states and 9244 transitions. [2019-09-08 12:19:00,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 9244 transitions. [2019-09-08 12:19:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:19:00,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:00,313 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] [2019-09-08 12:19:00,313 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash 470166097, now seen corresponding path program 1 times [2019-09-08 12:19:00,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:00,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:00,369 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 12:19:00,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:00,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:00,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:00,370 INFO L87 Difference]: Start difference. First operand 6744 states and 9244 transitions. Second operand 3 states. [2019-09-08 12:19:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:06,075 INFO L93 Difference]: Finished difference Result 14808 states and 20276 transitions. [2019-09-08 12:19:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:06,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:19:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:06,083 INFO L225 Difference]: With dead ends: 14808 [2019-09-08 12:19:06,083 INFO L226 Difference]: Without dead ends: 8158 [2019-09-08 12:19:06,090 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 12:19:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8158 states. [2019-09-08 12:19:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8158 to 7764. [2019-09-08 12:19:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7764 states. [2019-09-08 12:19:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7764 states to 7764 states and 10545 transitions. [2019-09-08 12:19:11,491 INFO L78 Accepts]: Start accepts. Automaton has 7764 states and 10545 transitions. Word has length 122 [2019-09-08 12:19:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:11,491 INFO L475 AbstractCegarLoop]: Abstraction has 7764 states and 10545 transitions. [2019-09-08 12:19:11,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7764 states and 10545 transitions. [2019-09-08 12:19:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:19:11,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:11,492 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] [2019-09-08 12:19:11,492 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1737959858, now seen corresponding path program 1 times [2019-09-08 12:19:11,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:11,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:11,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:11,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:11,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:11,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:11,539 INFO L87 Difference]: Start difference. First operand 7764 states and 10545 transitions. Second operand 3 states. [2019-09-08 12:19:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:17,332 INFO L93 Difference]: Finished difference Result 15864 states and 21547 transitions. [2019-09-08 12:19:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:17,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:19:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:17,341 INFO L225 Difference]: With dead ends: 15864 [2019-09-08 12:19:17,341 INFO L226 Difference]: Without dead ends: 8194 [2019-09-08 12:19:17,349 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 12:19:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-09-08 12:19:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8032. [2019-09-08 12:19:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2019-09-08 12:19:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 10821 transitions. [2019-09-08 12:19:23,049 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 10821 transitions. Word has length 123 [2019-09-08 12:19:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:23,049 INFO L475 AbstractCegarLoop]: Abstraction has 8032 states and 10821 transitions. [2019-09-08 12:19:23,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 10821 transitions. [2019-09-08 12:19:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:19:23,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:23,052 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:19:23,052 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1630138217, now seen corresponding path program 1 times [2019-09-08 12:19:23,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:23,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:19:23,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:19:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:23,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:19:23,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:19:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 12:19:23,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:19:23,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:19:23,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:19:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:19:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:19:23,750 INFO L87 Difference]: Start difference. First operand 8032 states and 10821 transitions. Second operand 11 states. [2019-09-08 12:20:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:15,795 INFO L93 Difference]: Finished difference Result 76594 states and 102976 transitions. [2019-09-08 12:20:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:20:15,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 12:20:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:16,065 INFO L225 Difference]: With dead ends: 76594 [2019-09-08 12:20:16,065 INFO L226 Difference]: Without dead ends: 68656 [2019-09-08 12:20:16,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:20:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68656 states. [2019-09-08 12:20:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68656 to 13096. [2019-09-08 12:20:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13096 states. [2019-09-08 12:20:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 17573 transitions. [2019-09-08 12:20:26,449 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 17573 transitions. Word has length 151 [2019-09-08 12:20:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:26,449 INFO L475 AbstractCegarLoop]: Abstraction has 13096 states and 17573 transitions. [2019-09-08 12:20:26,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:20:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 17573 transitions. [2019-09-08 12:20:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:20:26,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:26,453 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:26,453 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash 245011095, now seen corresponding path program 1 times [2019-09-08 12:20:26,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:26,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:20:26,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:20:26,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:20:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:20:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:20:26,658 INFO L87 Difference]: Start difference. First operand 13096 states and 17573 transitions. Second operand 7 states. [2019-09-08 12:21:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:11,448 INFO L93 Difference]: Finished difference Result 72912 states and 97839 transitions. [2019-09-08 12:21:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:21:11,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-08 12:21:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:11,533 INFO L225 Difference]: With dead ends: 72912 [2019-09-08 12:21:11,533 INFO L226 Difference]: Without dead ends: 59910 [2019-09-08 12:21:11,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59910 states. [2019-09-08 12:21:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59910 to 18160. [2019-09-08 12:21:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18160 states. [2019-09-08 12:21:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18160 states to 18160 states and 24325 transitions. [2019-09-08 12:21:25,860 INFO L78 Accepts]: Start accepts. Automaton has 18160 states and 24325 transitions. Word has length 151 [2019-09-08 12:21:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:25,860 INFO L475 AbstractCegarLoop]: Abstraction has 18160 states and 24325 transitions. [2019-09-08 12:21:25,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:21:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 18160 states and 24325 transitions. [2019-09-08 12:21:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:21:25,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:25,863 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:25,863 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash 609096855, now seen corresponding path program 1 times [2019-09-08 12:21:25,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:25,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:26,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:21:26,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:21:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:26,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:21:26,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:21:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:21:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:21:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:21:26,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:21:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:21:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:21:26,518 INFO L87 Difference]: Start difference. First operand 18160 states and 24325 transitions. Second operand 11 states. [2019-09-08 12:22:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:45,219 INFO L93 Difference]: Finished difference Result 116926 states and 156992 transitions. [2019-09-08 12:22:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:22:45,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 12:22:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:45,330 INFO L225 Difference]: With dead ends: 116926 [2019-09-08 12:22:45,330 INFO L226 Difference]: Without dead ends: 103924 [2019-09-08 12:22:45,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:22:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103924 states. [2019-09-08 12:23:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103924 to 26402. [2019-09-08 12:23:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26402 states. [2019-09-08 12:23:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 35369 transitions. [2019-09-08 12:23:07,880 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 35369 transitions. Word has length 151 [2019-09-08 12:23:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:07,880 INFO L475 AbstractCegarLoop]: Abstraction has 26402 states and 35369 transitions. [2019-09-08 12:23:07,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:23:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 35369 transitions. [2019-09-08 12:23:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:23:07,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:07,884 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:23:07,884 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1349555863, now seen corresponding path program 1 times [2019-09-08 12:23:07,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:07,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:07,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:08,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:23:08,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:23:08,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:08,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:23:08,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:23:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:23:08,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:23:08,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:23:08,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:23:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:23:08,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:23:08,658 INFO L87 Difference]: Start difference. First operand 26402 states and 35369 transitions. Second operand 11 states. [2019-09-08 12:24:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:41,653 INFO L93 Difference]: Finished difference Result 140768 states and 188972 transitions. [2019-09-08 12:24:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:24:41,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 12:24:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:41,785 INFO L225 Difference]: With dead ends: 140768 [2019-09-08 12:24:41,785 INFO L226 Difference]: Without dead ends: 119524 [2019-09-08 12:24:41,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:24:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119524 states. [2019-09-08 12:25:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119524 to 33115. [2019-09-08 12:25:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33115 states. [2019-09-08 12:25:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33115 states to 33115 states and 44360 transitions. [2019-09-08 12:25:09,809 INFO L78 Accepts]: Start accepts. Automaton has 33115 states and 44360 transitions. Word has length 151 [2019-09-08 12:25:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:09,809 INFO L475 AbstractCegarLoop]: Abstraction has 33115 states and 44360 transitions. [2019-09-08 12:25:09,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:25:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 33115 states and 44360 transitions. [2019-09-08 12:25:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:25:09,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:09,813 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:09,813 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -502160129, now seen corresponding path program 1 times [2019-09-08 12:25:09,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:25:09,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:09,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:25:09,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:25:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:25:09,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:25:09,958 INFO L87 Difference]: Start difference. First operand 33115 states and 44360 transitions. Second operand 7 states. [2019-09-08 12:26:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:21,447 INFO L93 Difference]: Finished difference Result 119376 states and 160097 transitions. [2019-09-08 12:26:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:26:21,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-09-08 12:26:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:21,550 INFO L225 Difference]: With dead ends: 119376 [2019-09-08 12:26:21,550 INFO L226 Difference]: Without dead ends: 91419 [2019-09-08 12:26:21,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:26:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91419 states. [2019-09-08 12:26:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91419 to 40679. [2019-09-08 12:26:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40679 states. [2019-09-08 12:26:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40679 states to 40679 states and 54408 transitions. [2019-09-08 12:26:55,796 INFO L78 Accepts]: Start accepts. Automaton has 40679 states and 54408 transitions. Word has length 152 [2019-09-08 12:26:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:55,796 INFO L475 AbstractCegarLoop]: Abstraction has 40679 states and 54408 transitions. [2019-09-08 12:26:55,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:26:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40679 states and 54408 transitions. [2019-09-08 12:26:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:26:55,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:55,800 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:55,801 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2110971407, now seen corresponding path program 1 times [2019-09-08 12:26:55,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:55,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:56,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:26:56,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:26:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:56,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 12:26:56,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:26:56,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:26:56,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:26:56,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:26:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:57,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:26:57,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-08 12:26:57,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:26:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:26:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:57,089 INFO L87 Difference]: Start difference. First operand 40679 states and 54408 transitions. Second operand 21 states. [2019-09-08 12:26:59,438 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-08 12:26:59,721 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-08 12:26:59,976 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:27:00,459 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:27:01,021 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:27:01,232 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:01,417 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 12:27:01,721 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:01,869 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:27:02,165 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-08 12:27:02,320 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:27:02,758 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:27:03,244 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:03,446 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-08 12:27:03,623 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:27:03,790 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 12:27:03,989 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-08 12:27:04,378 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:04,604 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:27:04,862 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:27:05,002 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:27:05,313 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:27:06,968 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:08,076 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:08,280 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:27:08,459 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:27:08,642 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:27:09,406 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:27:09,600 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:09,782 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:27:10,140 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:27:10,292 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:10,827 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:27:11,521 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 12:27:11,716 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:27:11,908 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:12,057 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:12,292 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-08 12:27:12,446 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:27:12,622 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 12:27:12,863 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:13,702 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:27:14,060 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-08 12:27:14,278 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:27:14,412 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:27:14,607 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:27:14,777 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:27:14,997 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 12:27:15,168 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:27:15,368 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-08 12:27:15,543 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-08 12:27:15,785 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 12:27:15,959 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:16,111 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:27:16,321 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-08 12:27:16,465 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:27:16,917 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:27:17,453 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:27:17,633 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:27:17,825 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:27:18,175 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:18,419 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:27:18,604 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:18,737 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:18,975 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-08 12:27:19,177 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-08 12:27:19,377 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:27:19,531 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 12:27:19,787 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:20,003 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:20,223 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 12:27:20,383 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:20,568 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-08 12:27:20,791 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-08 12:27:21,488 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 12:27:21,666 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:27:21,989 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 12:27:22,377 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:27:22,585 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:27:22,734 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:27:23,190 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 12:27:23,399 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-08 12:27:23,690 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:27:23,854 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-08 12:27:24,028 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:24,264 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:24,499 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-08 12:27:24,681 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-08 12:27:24,900 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:27:25,498 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:25,817 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:26,386 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:27:26,543 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:27:27,518 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:27:27,993 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:27:28,483 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:27:28,692 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:28,895 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 12:27:29,096 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 12:27:29,325 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-08 12:27:29,574 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 12:27:29,785 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-08 12:27:30,059 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:27:30,207 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:27:30,435 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:30,719 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-08 12:27:30,908 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 12:27:31,188 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:27:31,631 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:27:32,207 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:27:32,419 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:27:33,108 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:27:33,295 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 12:27:33,943 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:27:34,266 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:34,498 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:27:34,801 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-08 12:27:34,961 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:27:35,151 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:27:35,472 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:35,753 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:35,922 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-08 12:27:36,141 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-08 12:27:36,345 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:27:36,567 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:27:36,718 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 12:27:37,324 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:27:37,624 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:27:38,002 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:38,939 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:27:39,138 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:27:39,499 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:27:40,280 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 12:27:40,487 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-08 12:27:40,733 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-08 12:27:41,013 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-08 12:27:41,334 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 12:27:41,866 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-08 12:27:42,105 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-08 12:27:42,268 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:27:42,649 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:42,957 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:27:43,143 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:43,380 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 12:27:43,918 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:27:44,118 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:27:44,887 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:27:45,752 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 12:27:46,993 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:47,161 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:27:47,348 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-08 12:27:47,529 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:47,727 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:27:47,922 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:27:48,758 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:27:49,081 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 12:27:49,478 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:27:49,676 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:49,884 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:27:50,340 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:27:50,640 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:27:51,672 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:27:52,973 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:27:53,819 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:27:53,983 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-08 12:27:54,197 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:27:54,372 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:55,145 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-08 12:27:55,310 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:27:56,282 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:27:58,982 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:28:01,056 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-08 12:28:01,258 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 12:28:02,457 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:28:05,317 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62