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.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:10:05,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:10:05,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:10:05,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:10:05,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:10:05,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:10:05,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:10:05,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:10:05,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:10:05,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:10:05,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:10:05,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:10:05,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:10:05,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:10:05,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:10:05,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:10:05,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:10:05,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:10:05,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:10:05,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:10:05,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:10:05,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:10:05,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:10:05,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:10:05,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:10:05,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:10:05,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:10:05,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:10:05,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:10:05,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:10:05,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:10:05,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:10:05,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:10:05,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:10:05,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:10:05,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:10:05,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:10:05,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:10:05,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:10:05,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:10:05,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:10:05,825 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:10:05,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:10:05,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:10:05,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:10:05,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:10:05,843 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:10:05,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:10:05,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:10:05,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:10:05,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:10:05,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:10:05,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:10:05,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:10:05,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:10:05,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:10:05,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:10:05,846 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:10:05,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:10:05,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:10:05,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:10:05,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:10:05,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:10:05,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:10:05,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:10:05,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:10:05,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:10:05,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:10:05,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:10:05,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:10:05,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:10:05,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:10:05,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:10:05,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:10:05,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:10:05,902 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:10:05,903 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.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:10:05,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bea953e4/6da51e1eb7a44b208fe73bb4faada74c/FLAG4a058ebe2 [2019-09-08 12:10:06,765 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:10:06,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:10:06,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bea953e4/6da51e1eb7a44b208fe73bb4faada74c/FLAG4a058ebe2 [2019-09-08 12:10:07,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bea953e4/6da51e1eb7a44b208fe73bb4faada74c [2019-09-08 12:10:07,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:10:07,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:10:07,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:10:07,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:10:07,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:10:07,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:10:07" (1/1) ... [2019-09-08 12:10:07,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b55efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:07, skipping insertion in model container [2019-09-08 12:10:07,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:10:07" (1/1) ... [2019-09-08 12:10:07,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:10:07,523 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:10:08,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:10:08,767 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:10:09,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:10:09,224 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:10:09,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09 WrapperNode [2019-09-08 12:10:09,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:10:09,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:10:09,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:10:09,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:10:09,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (1/1) ... [2019-09-08 12:10:09,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:10:09,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:10:09,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:10:09,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:10:09,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (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:10:09,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:10:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:10:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:10:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:10:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:10:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:10:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:10:09,608 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:10:09,609 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:10:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:10:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:10:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:10:09,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:10:13,241 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:10:13,242 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:10:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:10:13 BoogieIcfgContainer [2019-09-08 12:10:13,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:10:13,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:10:13,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:10:13,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:10:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:10:07" (1/3) ... [2019-09-08 12:10:13,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afcf3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:10:13, skipping insertion in model container [2019-09-08 12:10:13,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:10:09" (2/3) ... [2019-09-08 12:10:13,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afcf3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:10:13, skipping insertion in model container [2019-09-08 12:10:13,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:10:13" (3/3) ... [2019-09-08 12:10:13,255 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 12:10:13,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:10:13,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:10:13,291 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:10:13,330 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:10:13,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:10:13,331 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:10:13,331 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:10:13,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:10:13,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:10:13,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:10:13,332 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:10:13,332 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:10:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states. [2019-09-08 12:10:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:10:13,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:13,395 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:10:13,397 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1025872216, now seen corresponding path program 1 times [2019-09-08 12:10:13,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:13,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:14,100 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:10:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:14,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:10:14,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:10:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:10:14,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:10:14,125 INFO L87 Difference]: Start difference. First operand 1198 states. Second operand 5 states. [2019-09-08 12:10:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:15,531 INFO L93 Difference]: Finished difference Result 1564 states and 2668 transitions. [2019-09-08 12:10:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:10:15,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:10:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:15,558 INFO L225 Difference]: With dead ends: 1564 [2019-09-08 12:10:15,558 INFO L226 Difference]: Without dead ends: 949 [2019-09-08 12:10:15,566 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:10:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-08 12:10:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2019-09-08 12:10:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-09-08 12:10:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1205 transitions. [2019-09-08 12:10:15,685 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1205 transitions. Word has length 77 [2019-09-08 12:10:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:15,685 INFO L475 AbstractCegarLoop]: Abstraction has 949 states and 1205 transitions. [2019-09-08 12:10:15,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1205 transitions. [2019-09-08 12:10:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:10:15,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:15,691 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:10:15,691 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:15,692 INFO L82 PathProgramCache]: Analyzing trace with hash -991361587, now seen corresponding path program 1 times [2019-09-08 12:10:15,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:15,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:15,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:15,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:15,978 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:10:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:10:15,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:10:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:10:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:10:15,985 INFO L87 Difference]: Start difference. First operand 949 states and 1205 transitions. Second operand 5 states. [2019-09-08 12:10:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:16,587 INFO L93 Difference]: Finished difference Result 1087 states and 1370 transitions. [2019-09-08 12:10:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:10:16,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:10:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:16,592 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:10:16,592 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 12:10:16,594 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:10:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 12:10:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 12:10:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 12:10:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 784 transitions. [2019-09-08 12:10:16,626 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 784 transitions. Word has length 77 [2019-09-08 12:10:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:16,627 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 784 transitions. [2019-09-08 12:10:16,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 784 transitions. [2019-09-08 12:10:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:10:16,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:16,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] [2019-09-08 12:10:16,630 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2088333632, now seen corresponding path program 1 times [2019-09-08 12:10:16,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:16,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:16,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:16,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:16,858 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:10:16,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:16,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:10:16,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:10:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:10:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:10:16,861 INFO L87 Difference]: Start difference. First operand 621 states and 784 transitions. Second operand 5 states. [2019-09-08 12:10:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:17,391 INFO L93 Difference]: Finished difference Result 843 states and 1068 transitions. [2019-09-08 12:10:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:10:17,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:10:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:17,396 INFO L225 Difference]: With dead ends: 843 [2019-09-08 12:10:17,396 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 12:10:17,399 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:10:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 12:10:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-08 12:10:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-08 12:10:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 660 transitions. [2019-09-08 12:10:17,423 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 660 transitions. Word has length 77 [2019-09-08 12:10:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:17,425 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 660 transitions. [2019-09-08 12:10:17,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 660 transitions. [2019-09-08 12:10:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:10:17,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:17,428 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:10:17,429 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2006758657, now seen corresponding path program 1 times [2019-09-08 12:10:17,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:17,616 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:10:17,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:17,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:10:17,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:10:17,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:10:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:10:17,620 INFO L87 Difference]: Start difference. First operand 520 states and 660 transitions. Second operand 5 states. [2019-09-08 12:10:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:18,296 INFO L93 Difference]: Finished difference Result 778 states and 997 transitions. [2019-09-08 12:10:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:10:18,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 12:10:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:18,305 INFO L225 Difference]: With dead ends: 778 [2019-09-08 12:10:18,305 INFO L226 Difference]: Without dead ends: 504 [2019-09-08 12:10:18,307 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:10:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-08 12:10:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-08 12:10:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-08 12:10:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 641 transitions. [2019-09-08 12:10:18,338 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 641 transitions. Word has length 79 [2019-09-08 12:10:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:18,339 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 641 transitions. [2019-09-08 12:10:18,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 641 transitions. [2019-09-08 12:10:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:10:18,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:18,342 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:10:18,342 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:18,343 INFO L82 PathProgramCache]: Analyzing trace with hash 748510916, now seen corresponding path program 1 times [2019-09-08 12:10:18,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:18,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:18,533 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:10:18,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:18,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:10:18,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:10:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:10:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:10:18,536 INFO L87 Difference]: Start difference. First operand 504 states and 641 transitions. Second operand 5 states. [2019-09-08 12:10:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:18,968 INFO L93 Difference]: Finished difference Result 690 states and 875 transitions. [2019-09-08 12:10:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:10:18,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:10:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:18,972 INFO L225 Difference]: With dead ends: 690 [2019-09-08 12:10:18,972 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 12:10:18,974 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:10:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 12:10:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-08 12:10:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 541 transitions. [2019-09-08 12:10:18,998 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 541 transitions. Word has length 81 [2019-09-08 12:10:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:18,998 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 541 transitions. [2019-09-08 12:10:18,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 541 transitions. [2019-09-08 12:10:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:10:19,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:19,006 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:10:19,006 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -763074199, now seen corresponding path program 1 times [2019-09-08 12:10:19,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:19,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:19,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:19,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:19,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:19,293 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:10:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:10:19,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:10:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:10:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:10:19,294 INFO L87 Difference]: Start difference. First operand 427 states and 541 transitions. Second operand 8 states. [2019-09-08 12:10:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:20,111 INFO L93 Difference]: Finished difference Result 825 states and 1030 transitions. [2019-09-08 12:10:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:10:20,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 12:10:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:20,118 INFO L225 Difference]: With dead ends: 825 [2019-09-08 12:10:20,119 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 12:10:20,120 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:10:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 12:10:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 427. [2019-09-08 12:10:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 540 transitions. [2019-09-08 12:10:20,176 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 540 transitions. Word has length 83 [2019-09-08 12:10:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:20,179 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 540 transitions. [2019-09-08 12:10:20,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:10:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 540 transitions. [2019-09-08 12:10:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:10:20,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:20,182 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:10:20,183 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 847032169, now seen corresponding path program 1 times [2019-09-08 12:10:20,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:20,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:20,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:20,450 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:10:20,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:20,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:20,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:20,452 INFO L87 Difference]: Start difference. First operand 427 states and 540 transitions. Second operand 9 states. [2019-09-08 12:10:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:21,861 INFO L93 Difference]: Finished difference Result 928 states and 1219 transitions. [2019-09-08 12:10:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:21,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:10:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:21,866 INFO L225 Difference]: With dead ends: 928 [2019-09-08 12:10:21,866 INFO L226 Difference]: Without dead ends: 791 [2019-09-08 12:10:21,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-08 12:10:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 427. [2019-09-08 12:10:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 539 transitions. [2019-09-08 12:10:21,899 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 539 transitions. Word has length 83 [2019-09-08 12:10:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:21,899 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 539 transitions. [2019-09-08 12:10:21,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 539 transitions. [2019-09-08 12:10:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:10:21,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:21,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:10:21,902 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash 560401961, now seen corresponding path program 1 times [2019-09-08 12:10:21,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:21,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:21,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:21,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:22,108 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:10:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:22,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:22,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:22,110 INFO L87 Difference]: Start difference. First operand 427 states and 539 transitions. Second operand 9 states. [2019-09-08 12:10:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:23,965 INFO L93 Difference]: Finished difference Result 881 states and 1159 transitions. [2019-09-08 12:10:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:23,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:10:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:23,972 INFO L225 Difference]: With dead ends: 881 [2019-09-08 12:10:23,972 INFO L226 Difference]: Without dead ends: 787 [2019-09-08 12:10:23,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-08 12:10:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-08 12:10:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 538 transitions. [2019-09-08 12:10:24,026 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 538 transitions. Word has length 83 [2019-09-08 12:10:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:24,026 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 538 transitions. [2019-09-08 12:10:24,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 538 transitions. [2019-09-08 12:10:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:10:24,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:24,030 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:10:24,030 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1854316557, now seen corresponding path program 1 times [2019-09-08 12:10:24,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:24,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:24,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:24,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:24,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:24,359 INFO L87 Difference]: Start difference. First operand 427 states and 538 transitions. Second operand 9 states. [2019-09-08 12:10:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:25,825 INFO L93 Difference]: Finished difference Result 854 states and 1117 transitions. [2019-09-08 12:10:25,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:25,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:10:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:25,830 INFO L225 Difference]: With dead ends: 854 [2019-09-08 12:10:25,830 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 12:10:25,834 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:10:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 12:10:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-08 12:10:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 537 transitions. [2019-09-08 12:10:25,872 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 537 transitions. Word has length 84 [2019-09-08 12:10:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:25,872 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 537 transitions. [2019-09-08 12:10:25,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 537 transitions. [2019-09-08 12:10:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:25,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:25,874 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:10:25,875 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash -15576114, now seen corresponding path program 1 times [2019-09-08 12:10:25,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:25,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:25,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:26,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:10:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:26,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:26,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:26,171 INFO L87 Difference]: Start difference. First operand 427 states and 537 transitions. Second operand 9 states. [2019-09-08 12:10:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:27,885 INFO L93 Difference]: Finished difference Result 890 states and 1164 transitions. [2019-09-08 12:10:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:27,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:27,893 INFO L225 Difference]: With dead ends: 890 [2019-09-08 12:10:27,893 INFO L226 Difference]: Without dead ends: 787 [2019-09-08 12:10:27,894 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:10:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-08 12:10:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-08 12:10:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 536 transitions. [2019-09-08 12:10:27,949 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 536 transitions. Word has length 85 [2019-09-08 12:10:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:27,949 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 536 transitions. [2019-09-08 12:10:27,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 536 transitions. [2019-09-08 12:10:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:27,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:27,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:27,953 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1212918770, now seen corresponding path program 1 times [2019-09-08 12:10:27,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:27,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:27,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:28,249 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:10:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:28,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:28,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:28,252 INFO L87 Difference]: Start difference. First operand 427 states and 536 transitions. Second operand 9 states. [2019-09-08 12:10:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:29,610 INFO L93 Difference]: Finished difference Result 858 states and 1118 transitions. [2019-09-08 12:10:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:29,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:29,616 INFO L225 Difference]: With dead ends: 858 [2019-09-08 12:10:29,616 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 12:10:29,617 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:10:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 12:10:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-08 12:10:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 535 transitions. [2019-09-08 12:10:29,654 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 535 transitions. Word has length 85 [2019-09-08 12:10:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:29,655 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 535 transitions. [2019-09-08 12:10:29,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 535 transitions. [2019-09-08 12:10:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:29,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:29,657 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:10:29,657 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1860056526, now seen corresponding path program 1 times [2019-09-08 12:10:29,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:29,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:29,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:29,898 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:10:29,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:29,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:29,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:29,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:29,901 INFO L87 Difference]: Start difference. First operand 427 states and 535 transitions. Second operand 9 states. [2019-09-08 12:10:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:31,399 INFO L93 Difference]: Finished difference Result 943 states and 1225 transitions. [2019-09-08 12:10:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:31,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:31,404 INFO L225 Difference]: With dead ends: 943 [2019-09-08 12:10:31,404 INFO L226 Difference]: Without dead ends: 791 [2019-09-08 12:10:31,405 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:10:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-08 12:10:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 427. [2019-09-08 12:10:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 534 transitions. [2019-09-08 12:10:31,442 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 534 transitions. Word has length 85 [2019-09-08 12:10:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:31,443 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 534 transitions. [2019-09-08 12:10:31,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 534 transitions. [2019-09-08 12:10:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:31,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:31,445 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:10:31,445 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash 920806414, now seen corresponding path program 1 times [2019-09-08 12:10:31,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:31,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:31,625 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:10:31,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:31,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:31,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:31,627 INFO L87 Difference]: Start difference. First operand 427 states and 534 transitions. Second operand 9 states. [2019-09-08 12:10:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:33,170 INFO L93 Difference]: Finished difference Result 890 states and 1163 transitions. [2019-09-08 12:10:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:33,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:33,174 INFO L225 Difference]: With dead ends: 890 [2019-09-08 12:10:33,174 INFO L226 Difference]: Without dead ends: 787 [2019-09-08 12:10:33,175 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:10:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-08 12:10:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 427. [2019-09-08 12:10:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 533 transitions. [2019-09-08 12:10:33,214 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 533 transitions. Word has length 85 [2019-09-08 12:10:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:33,214 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 533 transitions. [2019-09-08 12:10:33,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 533 transitions. [2019-09-08 12:10:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:33,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:33,216 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:10:33,216 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1035004846, now seen corresponding path program 1 times [2019-09-08 12:10:33,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:33,391 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:10:33,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:33,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:33,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:33,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:33,394 INFO L87 Difference]: Start difference. First operand 427 states and 533 transitions. Second operand 9 states. [2019-09-08 12:10:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:34,695 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2019-09-08 12:10:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:34,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:34,699 INFO L225 Difference]: With dead ends: 858 [2019-09-08 12:10:34,700 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 12:10:34,700 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:10:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 12:10:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 427. [2019-09-08 12:10:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:10:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 532 transitions. [2019-09-08 12:10:34,740 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 532 transitions. Word has length 85 [2019-09-08 12:10:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:34,740 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 532 transitions. [2019-09-08 12:10:34,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 532 transitions. [2019-09-08 12:10:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:34,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:34,742 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:10:34,742 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1147266175, now seen corresponding path program 1 times [2019-09-08 12:10:34,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:34,922 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:10:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:34,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:34,924 INFO L87 Difference]: Start difference. First operand 427 states and 532 transitions. Second operand 9 states. [2019-09-08 12:10:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:36,237 INFO L93 Difference]: Finished difference Result 828 states and 1070 transitions. [2019-09-08 12:10:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:36,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:36,241 INFO L225 Difference]: With dead ends: 828 [2019-09-08 12:10:36,241 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:36,242 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:10:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 530 transitions. [2019-09-08 12:10:36,284 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 530 transitions. Word has length 85 [2019-09-08 12:10:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:36,285 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 530 transitions. [2019-09-08 12:10:36,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 530 transitions. [2019-09-08 12:10:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:10:36,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:36,286 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:10:36,287 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -207377138, now seen corresponding path program 1 times [2019-09-08 12:10:36,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:36,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:36,462 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:10:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:36,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:36,466 INFO L87 Difference]: Start difference. First operand 426 states and 530 transitions. Second operand 9 states. [2019-09-08 12:10:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:37,707 INFO L93 Difference]: Finished difference Result 857 states and 1112 transitions. [2019-09-08 12:10:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:37,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:10:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:37,712 INFO L225 Difference]: With dead ends: 857 [2019-09-08 12:10:37,713 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 12:10:37,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 12:10:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-08 12:10:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 529 transitions. [2019-09-08 12:10:37,758 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 529 transitions. Word has length 85 [2019-09-08 12:10:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:37,759 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 529 transitions. [2019-09-08 12:10:37,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 529 transitions. [2019-09-08 12:10:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:10:37,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:37,761 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:10:37,761 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -669368786, now seen corresponding path program 1 times [2019-09-08 12:10:37,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:37,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:37,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:37,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:10:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:37,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:37,950 INFO L87 Difference]: Start difference. First operand 426 states and 529 transitions. Second operand 9 states. [2019-09-08 12:10:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:39,418 INFO L93 Difference]: Finished difference Result 830 states and 1070 transitions. [2019-09-08 12:10:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:39,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:10:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:39,422 INFO L225 Difference]: With dead ends: 830 [2019-09-08 12:10:39,422 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:39,423 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:10:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2019-09-08 12:10:39,467 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2019-09-08 12:10:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:39,467 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2019-09-08 12:10:39,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2019-09-08 12:10:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:10:39,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:39,469 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:10:39,469 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1385395406, now seen corresponding path program 1 times [2019-09-08 12:10:39,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:39,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:39,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:39,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:39,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:39,647 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:10:39,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:39,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:39,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:39,649 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand 9 states. [2019-09-08 12:10:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:40,970 INFO L93 Difference]: Finished difference Result 830 states and 1069 transitions. [2019-09-08 12:10:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:40,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:10:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:40,973 INFO L225 Difference]: With dead ends: 830 [2019-09-08 12:10:40,974 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:40,974 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:10:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 527 transitions. [2019-09-08 12:10:41,023 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 527 transitions. Word has length 86 [2019-09-08 12:10:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:41,023 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 527 transitions. [2019-09-08 12:10:41,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 527 transitions. [2019-09-08 12:10:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:10:41,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:41,025 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:10:41,026 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 858512238, now seen corresponding path program 1 times [2019-09-08 12:10:41,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:41,199 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:10:41,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:41,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:41,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:41,201 INFO L87 Difference]: Start difference. First operand 426 states and 527 transitions. Second operand 9 states. [2019-09-08 12:10:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:42,760 INFO L93 Difference]: Finished difference Result 830 states and 1068 transitions. [2019-09-08 12:10:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:42,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:10:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:42,764 INFO L225 Difference]: With dead ends: 830 [2019-09-08 12:10:42,764 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:42,765 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:10:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2019-09-08 12:10:42,815 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 86 [2019-09-08 12:10:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:42,815 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2019-09-08 12:10:42,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2019-09-08 12:10:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:10:42,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:42,817 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:10:42,818 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1124465518, now seen corresponding path program 1 times [2019-09-08 12:10:42,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:42,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:42,981 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:10:42,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:42,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:42,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:42,983 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand 9 states. [2019-09-08 12:10:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:44,444 INFO L93 Difference]: Finished difference Result 830 states and 1066 transitions. [2019-09-08 12:10:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:44,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:10:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:44,448 INFO L225 Difference]: With dead ends: 830 [2019-09-08 12:10:44,448 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:44,449 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:10:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 525 transitions. [2019-09-08 12:10:44,500 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 525 transitions. Word has length 86 [2019-09-08 12:10:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:44,500 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 525 transitions. [2019-09-08 12:10:44,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 525 transitions. [2019-09-08 12:10:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:44,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:44,502 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:10:44,503 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1332810989, now seen corresponding path program 1 times [2019-09-08 12:10:44,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:44,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:44,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:44,684 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:10:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:44,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:44,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:44,686 INFO L87 Difference]: Start difference. First operand 426 states and 525 transitions. Second operand 9 states. [2019-09-08 12:10:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:46,105 INFO L93 Difference]: Finished difference Result 833 states and 1068 transitions. [2019-09-08 12:10:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:46,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:46,110 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:10:46,110 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:46,111 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:10:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 524 transitions. [2019-09-08 12:10:46,158 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 524 transitions. Word has length 87 [2019-09-08 12:10:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:46,158 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 524 transitions. [2019-09-08 12:10:46,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 524 transitions. [2019-09-08 12:10:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:46,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:46,160 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:10:46,161 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 478571315, now seen corresponding path program 1 times [2019-09-08 12:10:46,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:46,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:46,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:46,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:46,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:46,346 INFO L87 Difference]: Start difference. First operand 426 states and 524 transitions. Second operand 9 states. [2019-09-08 12:10:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:47,603 INFO L93 Difference]: Finished difference Result 862 states and 1109 transitions. [2019-09-08 12:10:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:47,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:47,608 INFO L225 Difference]: With dead ends: 862 [2019-09-08 12:10:47,608 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 12:10:47,609 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:10:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 12:10:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-08 12:10:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 523 transitions. [2019-09-08 12:10:47,654 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 523 transitions. Word has length 87 [2019-09-08 12:10:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:47,655 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 523 transitions. [2019-09-08 12:10:47,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 523 transitions. [2019-09-08 12:10:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:47,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:47,656 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:10:47,657 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2101826515, now seen corresponding path program 1 times [2019-09-08 12:10:47,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:47,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:47,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:47,829 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:10:47,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:47,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:47,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:47,830 INFO L87 Difference]: Start difference. First operand 426 states and 523 transitions. Second operand 9 states. [2019-09-08 12:10:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:49,521 INFO L93 Difference]: Finished difference Result 895 states and 1152 transitions. [2019-09-08 12:10:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:49,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:49,524 INFO L225 Difference]: With dead ends: 895 [2019-09-08 12:10:49,525 INFO L226 Difference]: Without dead ends: 786 [2019-09-08 12:10:49,525 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:10:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-08 12:10:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 426. [2019-09-08 12:10:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 522 transitions. [2019-09-08 12:10:49,566 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 522 transitions. Word has length 87 [2019-09-08 12:10:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:49,566 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 522 transitions. [2019-09-08 12:10:49,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 522 transitions. [2019-09-08 12:10:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:49,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:49,568 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:10:49,569 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 244970323, now seen corresponding path program 1 times [2019-09-08 12:10:49,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:49,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:49,739 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:10:49,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:49,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:49,740 INFO L87 Difference]: Start difference. First operand 426 states and 522 transitions. Second operand 9 states. [2019-09-08 12:10:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:51,160 INFO L93 Difference]: Finished difference Result 797 states and 1011 transitions. [2019-09-08 12:10:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:51,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:51,163 INFO L225 Difference]: With dead ends: 797 [2019-09-08 12:10:51,163 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 12:10:51,164 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:10:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 12:10:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-08 12:10:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 521 transitions. [2019-09-08 12:10:51,202 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 521 transitions. Word has length 87 [2019-09-08 12:10:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:51,202 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 521 transitions. [2019-09-08 12:10:51,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 521 transitions. [2019-09-08 12:10:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:51,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:51,204 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:10:51,205 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1093485491, now seen corresponding path program 1 times [2019-09-08 12:10:51,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:51,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:51,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:51,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:10:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:51,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:51,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:51,376 INFO L87 Difference]: Start difference. First operand 426 states and 521 transitions. Second operand 9 states. [2019-09-08 12:10:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:52,855 INFO L93 Difference]: Finished difference Result 768 states and 968 transitions. [2019-09-08 12:10:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:52,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:52,859 INFO L225 Difference]: With dead ends: 768 [2019-09-08 12:10:52,859 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:52,860 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:10:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 520 transitions. [2019-09-08 12:10:52,906 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 520 transitions. Word has length 87 [2019-09-08 12:10:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:52,906 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 520 transitions. [2019-09-08 12:10:52,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 520 transitions. [2019-09-08 12:10:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:52,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:52,907 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:10:52,908 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1482555949, now seen corresponding path program 1 times [2019-09-08 12:10:52,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:52,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:52,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:53,091 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:10:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:53,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:53,093 INFO L87 Difference]: Start difference. First operand 426 states and 520 transitions. Second operand 9 states. [2019-09-08 12:10:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:54,602 INFO L93 Difference]: Finished difference Result 768 states and 967 transitions. [2019-09-08 12:10:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:54,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:54,606 INFO L225 Difference]: With dead ends: 768 [2019-09-08 12:10:54,606 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:54,607 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:10:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 519 transitions. [2019-09-08 12:10:54,657 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 519 transitions. Word has length 87 [2019-09-08 12:10:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:54,657 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 519 transitions. [2019-09-08 12:10:54,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 519 transitions. [2019-09-08 12:10:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:54,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:54,658 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:10:54,658 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1339772467, now seen corresponding path program 1 times [2019-09-08 12:10:54,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:54,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:54,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:54,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:54,819 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:10:54,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:54,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:54,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:54,820 INFO L87 Difference]: Start difference. First operand 426 states and 519 transitions. Second operand 9 states. [2019-09-08 12:10:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:56,275 INFO L93 Difference]: Finished difference Result 833 states and 1061 transitions. [2019-09-08 12:10:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:56,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:56,278 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:10:56,278 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:56,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 518 transitions. [2019-09-08 12:10:56,325 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 518 transitions. Word has length 87 [2019-09-08 12:10:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:56,325 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 518 transitions. [2019-09-08 12:10:56,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 518 transitions. [2019-09-08 12:10:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:56,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:56,326 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:10:56,327 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2086137837, now seen corresponding path program 1 times [2019-09-08 12:10:56,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:56,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:56,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:56,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:56,478 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:10:56,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:56,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:56,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:56,480 INFO L87 Difference]: Start difference. First operand 426 states and 518 transitions. Second operand 9 states. [2019-09-08 12:10:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:57,769 INFO L93 Difference]: Finished difference Result 862 states and 1100 transitions. [2019-09-08 12:10:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:57,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:57,772 INFO L225 Difference]: With dead ends: 862 [2019-09-08 12:10:57,772 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 12:10:57,773 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:10:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 12:10:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 426. [2019-09-08 12:10:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 517 transitions. [2019-09-08 12:10:57,819 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 517 transitions. Word has length 87 [2019-09-08 12:10:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:57,819 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 517 transitions. [2019-09-08 12:10:57,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 517 transitions. [2019-09-08 12:10:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:57,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:57,820 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:10:57,820 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash 923787283, now seen corresponding path program 1 times [2019-09-08 12:10:57,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:57,974 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:10:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:57,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:57,975 INFO L87 Difference]: Start difference. First operand 426 states and 517 transitions. Second operand 9 states. [2019-09-08 12:10:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:59,714 INFO L93 Difference]: Finished difference Result 833 states and 1059 transitions. [2019-09-08 12:10:59,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:59,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:10:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:59,717 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:10:59,717 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:10:59,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:10:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:10:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:10:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2019-09-08 12:10:59,757 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 87 [2019-09-08 12:10:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:59,757 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2019-09-08 12:10:59,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2019-09-08 12:10:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:59,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:59,758 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:10:59,759 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1851798797, now seen corresponding path program 1 times [2019-09-08 12:10:59,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:59,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:59,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:59,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:59,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:59,926 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:10:59,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:59,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:59,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:59,928 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 9 states. [2019-09-08 12:11:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:01,447 INFO L93 Difference]: Finished difference Result 768 states and 961 transitions. [2019-09-08 12:11:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:11:01,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:11:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:01,450 INFO L225 Difference]: With dead ends: 768 [2019-09-08 12:11:01,450 INFO L226 Difference]: Without dead ends: 762 [2019-09-08 12:11:01,451 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:11:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-08 12:11:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 426. [2019-09-08 12:11:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:11:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 515 transitions. [2019-09-08 12:11:01,512 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 515 transitions. Word has length 87 [2019-09-08 12:11:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:01,513 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 515 transitions. [2019-09-08 12:11:01,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:11:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 515 transitions. [2019-09-08 12:11:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:01,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:01,514 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:11:01,514 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2120002391, now seen corresponding path program 1 times [2019-09-08 12:11:01,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:01,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:01,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:02,833 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:11:02,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:02,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:11:02,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:11:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:11:02,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:11:02,835 INFO L87 Difference]: Start difference. First operand 426 states and 515 transitions. Second operand 21 states. [2019-09-08 12:11:03,810 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:11:04,084 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-08 12:11:04,280 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:11:04,438 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:11:04,632 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:11:06,526 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 12:11:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:08,513 INFO L93 Difference]: Finished difference Result 1049 states and 1332 transitions. [2019-09-08 12:11:08,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:11:08,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2019-09-08 12:11:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:08,518 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 12:11:08,518 INFO L226 Difference]: Without dead ends: 983 [2019-09-08 12:11:08,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:11:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-08 12:11:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 447. [2019-09-08 12:11:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 12:11:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 542 transitions. [2019-09-08 12:11:08,583 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 542 transitions. Word has length 88 [2019-09-08 12:11:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:08,583 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 542 transitions. [2019-09-08 12:11:08,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:11:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 542 transitions. [2019-09-08 12:11:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:08,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:08,584 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:11:08,588 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash 81782089, now seen corresponding path program 1 times [2019-09-08 12:11:08,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:09,336 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:11:09,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:11:09,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:11:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:11:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:11:09,337 INFO L87 Difference]: Start difference. First operand 447 states and 542 transitions. Second operand 17 states. [2019-09-08 12:11:09,900 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:11:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:11,704 INFO L93 Difference]: Finished difference Result 955 states and 1210 transitions. [2019-09-08 12:11:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:11:11,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-08 12:11:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:11,707 INFO L225 Difference]: With dead ends: 955 [2019-09-08 12:11:11,707 INFO L226 Difference]: Without dead ends: 824 [2019-09-08 12:11:11,708 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:11:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-08 12:11:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 420. [2019-09-08 12:11:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-08 12:11:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 508 transitions. [2019-09-08 12:11:11,771 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 508 transitions. Word has length 88 [2019-09-08 12:11:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:11,771 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 508 transitions. [2019-09-08 12:11:11,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:11:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 508 transitions. [2019-09-08 12:11:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:11,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:11,772 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:11:11,773 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash 384754761, now seen corresponding path program 1 times [2019-09-08 12:11:11,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:11,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:12,710 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:11:12,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:12,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:11:12,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:11:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:11:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:11:12,712 INFO L87 Difference]: Start difference. First operand 420 states and 508 transitions. Second operand 20 states. [2019-09-08 12:11:13,598 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:11:13,813 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-08 12:11:13,969 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:11:14,115 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:11:14,261 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:11:14,518 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:11:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:16,864 INFO L93 Difference]: Finished difference Result 903 states and 1119 transitions. [2019-09-08 12:11:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:11:16,864 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2019-09-08 12:11:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:16,868 INFO L225 Difference]: With dead ends: 903 [2019-09-08 12:11:16,868 INFO L226 Difference]: Without dead ends: 772 [2019-09-08 12:11:16,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:11:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-08 12:11:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 427. [2019-09-08 12:11:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 12:11:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 515 transitions. [2019-09-08 12:11:16,974 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 515 transitions. Word has length 88 [2019-09-08 12:11:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:16,974 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 515 transitions. [2019-09-08 12:11:16,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:11:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 515 transitions. [2019-09-08 12:11:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:16,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:16,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:16,976 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -566170359, now seen corresponding path program 1 times [2019-09-08 12:11:16,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:16,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:18,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:18,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:11:18,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:11:18,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:11:18,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:11:18,232 INFO L87 Difference]: Start difference. First operand 427 states and 515 transitions. Second operand 22 states. [2019-09-08 12:11:19,253 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:11:19,486 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 12:11:19,845 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 12:11:19,994 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:11:20,188 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:11:20,372 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:11:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:23,457 INFO L93 Difference]: Finished difference Result 829 states and 1038 transitions. [2019-09-08 12:11:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:11:23,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-08 12:11:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:23,460 INFO L225 Difference]: With dead ends: 829 [2019-09-08 12:11:23,461 INFO L226 Difference]: Without dead ends: 760 [2019-09-08 12:11:23,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:11:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-08 12:11:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 434. [2019-09-08 12:11:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 12:11:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 522 transitions. [2019-09-08 12:11:23,543 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 522 transitions. Word has length 88 [2019-09-08 12:11:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:23,544 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 522 transitions. [2019-09-08 12:11:23,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:11:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 522 transitions. [2019-09-08 12:11:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:23,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:23,545 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:11:23,545 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1156320813, now seen corresponding path program 1 times [2019-09-08 12:11:23,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:23,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:23,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:23,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:24,341 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:11:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:11:24,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:11:24,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:11:24,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:11:24,343 INFO L87 Difference]: Start difference. First operand 434 states and 522 transitions. Second operand 17 states. [2019-09-08 12:11:24,946 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:11:25,085 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:11:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:27,322 INFO L93 Difference]: Finished difference Result 869 states and 1100 transitions. [2019-09-08 12:11:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:11:27,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-08 12:11:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:27,328 INFO L225 Difference]: With dead ends: 869 [2019-09-08 12:11:27,328 INFO L226 Difference]: Without dead ends: 802 [2019-09-08 12:11:27,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:11:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-08 12:11:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 434. [2019-09-08 12:11:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 12:11:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 520 transitions. [2019-09-08 12:11:27,417 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 520 transitions. Word has length 88 [2019-09-08 12:11:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:27,417 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 520 transitions. [2019-09-08 12:11:27,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:11:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 520 transitions. [2019-09-08 12:11:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:11:27,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:27,418 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:11:27,418 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1020462135, now seen corresponding path program 1 times [2019-09-08 12:11:27,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:27,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:28,613 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:11:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:11:28,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:11:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:11:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:11:28,615 INFO L87 Difference]: Start difference. First operand 434 states and 520 transitions. Second operand 22 states. [2019-09-08 12:11:29,534 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 12:11:29,780 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:11:30,050 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 12:11:30,204 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:11:30,398 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-08 12:11:30,569 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 12:11:30,711 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:11:30,875 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:11:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:33,284 INFO L93 Difference]: Finished difference Result 845 states and 1053 transitions. [2019-09-08 12:11:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:11:33,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-08 12:11:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:33,287 INFO L225 Difference]: With dead ends: 845 [2019-09-08 12:11:33,288 INFO L226 Difference]: Without dead ends: 757 [2019-09-08 12:11:33,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:11:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-09-08 12:11:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 441. [2019-09-08 12:11:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-08 12:11:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 527 transitions. [2019-09-08 12:11:33,377 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 527 transitions. Word has length 88 [2019-09-08 12:11:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:33,378 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 527 transitions. [2019-09-08 12:11:33,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:11:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 527 transitions. [2019-09-08 12:11:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:33,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:33,379 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:11:33,380 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:33,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1790204216, now seen corresponding path program 1 times [2019-09-08 12:11:33,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:33,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:33,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:33,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:33,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:35,240 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:11:35,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:11:35,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:11:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:11:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:11:35,242 INFO L87 Difference]: Start difference. First operand 441 states and 527 transitions. Second operand 26 states. [2019-09-08 12:11:35,392 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 12:11:36,398 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:11:36,648 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-08 12:11:36,933 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-09-08 12:11:37,309 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-09-08 12:11:37,530 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:11:37,745 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:11:37,987 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 12:11:41,178 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:11:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:42,300 INFO L93 Difference]: Finished difference Result 848 states and 1029 transitions. [2019-09-08 12:11:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:11:42,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-09-08 12:11:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:42,303 INFO L225 Difference]: With dead ends: 848 [2019-09-08 12:11:42,303 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 12:11:42,304 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:11:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 12:11:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 452. [2019-09-08 12:11:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-08 12:11:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 543 transitions. [2019-09-08 12:11:42,426 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 543 transitions. Word has length 89 [2019-09-08 12:11:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:42,426 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 543 transitions. [2019-09-08 12:11:42,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:11:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 543 transitions. [2019-09-08 12:11:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:42,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11: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] [2019-09-08 12:11:42,428 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -363234600, now seen corresponding path program 1 times [2019-09-08 12:11:42,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:43,172 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:11:43,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:43,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:11:43,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:11:43,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:11:43,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:11:43,173 INFO L87 Difference]: Start difference. First operand 452 states and 543 transitions. Second operand 17 states. [2019-09-08 12:11:43,789 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:11:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:45,718 INFO L93 Difference]: Finished difference Result 866 states and 1099 transitions. [2019-09-08 12:11:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:11:45,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-08 12:11:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:45,721 INFO L225 Difference]: With dead ends: 866 [2019-09-08 12:11:45,721 INFO L226 Difference]: Without dead ends: 765 [2019-09-08 12:11:45,721 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:11:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-08 12:11:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 431. [2019-09-08 12:11:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-08 12:11:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 514 transitions. [2019-09-08 12:11:45,805 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 514 transitions. Word has length 89 [2019-09-08 12:11:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:45,805 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 514 transitions. [2019-09-08 12:11:45,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:11:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 514 transitions. [2019-09-08 12:11:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:45,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:45,806 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:11:45,806 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash -138543399, now seen corresponding path program 1 times [2019-09-08 12:11:45,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:46,174 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:11:46,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:46,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:11:46,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:11:46,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:11:46,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:11:46,175 INFO L87 Difference]: Start difference. First operand 431 states and 514 transitions. Second operand 11 states. [2019-09-08 12:11:47,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:47,033 INFO L93 Difference]: Finished difference Result 745 states and 933 transitions. [2019-09-08 12:11:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:11:47,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:11:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:47,035 INFO L225 Difference]: With dead ends: 745 [2019-09-08 12:11:47,035 INFO L226 Difference]: Without dead ends: 668 [2019-09-08 12:11:47,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:11:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-09-08 12:11:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 419. [2019-09-08 12:11:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-08 12:11:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 500 transitions. [2019-09-08 12:11:47,136 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 500 transitions. Word has length 89 [2019-09-08 12:11:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:47,136 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 500 transitions. [2019-09-08 12:11:47,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:11:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 500 transitions. [2019-09-08 12:11:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:47,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:47,137 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:11:47,137 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -303870206, now seen corresponding path program 1 times [2019-09-08 12:11:47,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:47,503 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:11:47,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:47,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:11:47,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:11:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:11:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:11:47,505 INFO L87 Difference]: Start difference. First operand 419 states and 500 transitions. Second operand 11 states. [2019-09-08 12:11:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:48,751 INFO L93 Difference]: Finished difference Result 1131 states and 1498 transitions. [2019-09-08 12:11:48,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:11:48,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:11:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:48,753 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 12:11:48,754 INFO L226 Difference]: Without dead ends: 1054 [2019-09-08 12:11:48,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:11:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-09-08 12:11:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 407. [2019-09-08 12:11:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-08 12:11:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 485 transitions. [2019-09-08 12:11:48,840 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 485 transitions. Word has length 89 [2019-09-08 12:11:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:48,841 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 485 transitions. [2019-09-08 12:11:48,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:11:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 485 transitions. [2019-09-08 12:11:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:48,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:48,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:48,842 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -957518029, now seen corresponding path program 1 times [2019-09-08 12:11:48,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:48,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:48,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:48,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:49,333 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:11:49,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:49,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:11:49,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:11:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:11:49,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:11:49,334 INFO L87 Difference]: Start difference. First operand 407 states and 485 transitions. Second operand 14 states. [2019-09-08 12:11:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:51,352 INFO L93 Difference]: Finished difference Result 774 states and 955 transitions. [2019-09-08 12:11:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:11:51,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-08 12:11:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:51,354 INFO L225 Difference]: With dead ends: 774 [2019-09-08 12:11:51,354 INFO L226 Difference]: Without dead ends: 697 [2019-09-08 12:11:51,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:11:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-08 12:11:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 399. [2019-09-08 12:11:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-08 12:11:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 474 transitions. [2019-09-08 12:11:51,450 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 474 transitions. Word has length 89 [2019-09-08 12:11:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:51,451 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 474 transitions. [2019-09-08 12:11:51,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:11:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 474 transitions. [2019-09-08 12:11:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:51,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:51,452 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:11:51,452 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1065628564, now seen corresponding path program 1 times [2019-09-08 12:11:51,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:51,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:52,014 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:11:52,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:52,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:11:52,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:11:52,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:11:52,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:11:52,015 INFO L87 Difference]: Start difference. First operand 399 states and 474 transitions. Second operand 14 states. [2019-09-08 12:11:52,755 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:11:52,889 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:11:53,020 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-08 12:11:53,165 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:11:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:54,435 INFO L93 Difference]: Finished difference Result 697 states and 845 transitions. [2019-09-08 12:11:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:11:54,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-08 12:11:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:54,437 INFO L225 Difference]: With dead ends: 697 [2019-09-08 12:11:54,437 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 12:11:54,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:11:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 12:11:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 393. [2019-09-08 12:11:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-08 12:11:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 467 transitions. [2019-09-08 12:11:54,547 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 467 transitions. Word has length 89 [2019-09-08 12:11:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:54,547 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 467 transitions. [2019-09-08 12:11:54,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:11:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 467 transitions. [2019-09-08 12:11:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:54,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:54,548 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:11:54,548 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 841334007, now seen corresponding path program 1 times [2019-09-08 12:11:54,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:54,947 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:11:54,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:54,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:11:54,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:11:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:11:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:11:54,949 INFO L87 Difference]: Start difference. First operand 393 states and 467 transitions. Second operand 12 states. [2019-09-08 12:11:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:55,858 INFO L93 Difference]: Finished difference Result 918 states and 1189 transitions. [2019-09-08 12:11:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:11:55,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-08 12:11:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:55,860 INFO L225 Difference]: With dead ends: 918 [2019-09-08 12:11:55,861 INFO L226 Difference]: Without dead ends: 798 [2019-09-08 12:11:55,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:11:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-08 12:11:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 338. [2019-09-08 12:11:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 12:11:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 404 transitions. [2019-09-08 12:11:55,951 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 404 transitions. Word has length 89 [2019-09-08 12:11:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:55,951 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 404 transitions. [2019-09-08 12:11:55,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:11:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 404 transitions. [2019-09-08 12:11:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:11:55,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:55,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:55,952 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2096385733, now seen corresponding path program 1 times [2019-09-08 12:11:55,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:55,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:56,656 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:11:56,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:56,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:11:56,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:11:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:11:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:11:56,661 INFO L87 Difference]: Start difference. First operand 338 states and 404 transitions. Second operand 16 states. [2019-09-08 12:11:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:59,365 INFO L93 Difference]: Finished difference Result 1161 states and 1528 transitions. [2019-09-08 12:11:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:11:59,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-08 12:11:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:59,368 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 12:11:59,368 INFO L226 Difference]: Without dead ends: 1069 [2019-09-08 12:11:59,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:11:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-09-08 12:11:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 310. [2019-09-08 12:11:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 12:11:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 369 transitions. [2019-09-08 12:11:59,447 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 369 transitions. Word has length 89 [2019-09-08 12:11:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:59,447 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 369 transitions. [2019-09-08 12:11:59,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:11:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 369 transitions. [2019-09-08 12:11:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:11:59,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:59,448 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] [2019-09-08 12:11:59,448 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2061266405, now seen corresponding path program 1 times [2019-09-08 12:11:59,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:59,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:59,785 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:11:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:59,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:11:59,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:11:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:11:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:11:59,786 INFO L87 Difference]: Start difference. First operand 310 states and 369 transitions. Second operand 11 states. [2019-09-08 12:12:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:01,056 INFO L93 Difference]: Finished difference Result 992 states and 1333 transitions. [2019-09-08 12:12:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:01,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-08 12:12:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:01,059 INFO L225 Difference]: With dead ends: 992 [2019-09-08 12:12:01,059 INFO L226 Difference]: Without dead ends: 906 [2019-09-08 12:12:01,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:12:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-08 12:12:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 270. [2019-09-08 12:12:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:12:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 319 transitions. [2019-09-08 12:12:01,179 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 319 transitions. Word has length 90 [2019-09-08 12:12:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:01,180 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 319 transitions. [2019-09-08 12:12:01,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:12:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 319 transitions. [2019-09-08 12:12:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:12:01,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:01,181 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] [2019-09-08 12:12:01,181 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1853534946, now seen corresponding path program 1 times [2019-09-08 12:12:01,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:01,609 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:12:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:12:01,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:12:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:12:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:12:01,611 INFO L87 Difference]: Start difference. First operand 270 states and 319 transitions. Second operand 12 states. [2019-09-08 12:12:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:03,061 INFO L93 Difference]: Finished difference Result 779 states and 1025 transitions. [2019-09-08 12:12:03,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:12:03,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 12:12:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:03,063 INFO L225 Difference]: With dead ends: 779 [2019-09-08 12:12:03,064 INFO L226 Difference]: Without dead ends: 690 [2019-09-08 12:12:03,064 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:12:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-08 12:12:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 246. [2019-09-08 12:12:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-08 12:12:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 292 transitions. [2019-09-08 12:12:03,175 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 292 transitions. Word has length 90 [2019-09-08 12:12:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:03,176 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 292 transitions. [2019-09-08 12:12:03,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:12:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 292 transitions. [2019-09-08 12:12:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:12:03,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:03,177 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] [2019-09-08 12:12:03,177 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1759645528, now seen corresponding path program 1 times [2019-09-08 12:12:03,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:03,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:03,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:03,929 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:12:03,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:03,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:12:03,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:12:03,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:12:03,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:12:03,930 INFO L87 Difference]: Start difference. First operand 246 states and 292 transitions. Second operand 16 states. [2019-09-08 12:12:04,538 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:12:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:05,907 INFO L93 Difference]: Finished difference Result 464 states and 552 transitions. [2019-09-08 12:12:05,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:12:05,907 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 90 [2019-09-08 12:12:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:05,908 INFO L225 Difference]: With dead ends: 464 [2019-09-08 12:12:05,908 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 12:12:05,909 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:12:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 12:12:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 271. [2019-09-08 12:12:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 12:12:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 322 transitions. [2019-09-08 12:12:05,985 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 322 transitions. Word has length 90 [2019-09-08 12:12:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:05,985 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 322 transitions. [2019-09-08 12:12:05,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:12:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 322 transitions. [2019-09-08 12:12:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:12:05,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:05,986 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] [2019-09-08 12:12:05,986 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:05,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash -576618081, now seen corresponding path program 1 times [2019-09-08 12:12:05,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:06,614 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:12:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:06,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:12:06,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:12:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:12:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:12:06,617 INFO L87 Difference]: Start difference. First operand 271 states and 322 transitions. Second operand 15 states. [2019-09-08 12:12:07,238 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:12:07,369 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:12:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:08,292 INFO L93 Difference]: Finished difference Result 612 states and 789 transitions. [2019-09-08 12:12:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:12:08,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-08 12:12:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:08,296 INFO L225 Difference]: With dead ends: 612 [2019-09-08 12:12:08,296 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 12:12:08,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:12:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 12:12:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 265. [2019-09-08 12:12:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-08 12:12:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 315 transitions. [2019-09-08 12:12:08,420 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 315 transitions. Word has length 90 [2019-09-08 12:12:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:08,420 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 315 transitions. [2019-09-08 12:12:08,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:12:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 315 transitions. [2019-09-08 12:12:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:12:08,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:08,422 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] [2019-09-08 12:12:08,422 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:08,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1327171516, now seen corresponding path program 1 times [2019-09-08 12:12:08,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:08,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:08,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:08,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:08,875 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:12:08,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:08,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:12:08,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:12:08,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:12:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:12:08,876 INFO L87 Difference]: Start difference. First operand 265 states and 315 transitions. Second operand 12 states. [2019-09-08 12:12:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:09,971 INFO L93 Difference]: Finished difference Result 477 states and 592 transitions. [2019-09-08 12:12:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:12:09,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 12:12:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:09,972 INFO L225 Difference]: With dead ends: 477 [2019-09-08 12:12:09,972 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 12:12:09,973 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:12:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 12:12:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 261. [2019-09-08 12:12:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 12:12:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 310 transitions. [2019-09-08 12:12:10,051 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 310 transitions. Word has length 90 [2019-09-08 12:12:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:10,051 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 310 transitions. [2019-09-08 12:12:10,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:12:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 310 transitions. [2019-09-08 12:12:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:12:10,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:10,052 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] [2019-09-08 12:12:10,052 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -863961032, now seen corresponding path program 1 times [2019-09-08 12:12:10,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:10,237 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:12:10,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:10,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:10,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:10,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:10,240 INFO L87 Difference]: Start difference. First operand 261 states and 310 transitions. Second operand 9 states. [2019-09-08 12:12:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:10,976 INFO L93 Difference]: Finished difference Result 464 states and 581 transitions. [2019-09-08 12:12:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:12:10,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-08 12:12:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:10,978 INFO L225 Difference]: With dead ends: 464 [2019-09-08 12:12:10,978 INFO L226 Difference]: Without dead ends: 379 [2019-09-08 12:12:10,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:12:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-08 12:12:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 261. [2019-09-08 12:12:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-08 12:12:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2019-09-08 12:12:11,063 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 91 [2019-09-08 12:12:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:11,064 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2019-09-08 12:12:11,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2019-09-08 12:12:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:12:11,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:11,064 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] [2019-09-08 12:12:11,065 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2010479467, now seen corresponding path program 1 times [2019-09-08 12:12:11,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:11,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:11,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:11,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:11,652 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:12:11,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:11,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:12:11,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:12:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:12:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:12:11,654 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand 13 states. [2019-09-08 12:12:12,140 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 12:12:12,286 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 12:12:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:13,320 INFO L93 Difference]: Finished difference Result 691 states and 901 transitions. [2019-09-08 12:12:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:12:13,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-08 12:12:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:13,322 INFO L225 Difference]: With dead ends: 691 [2019-09-08 12:12:13,323 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 12:12:13,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:12:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 12:12:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 205. [2019-09-08 12:12:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-08 12:12:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2019-09-08 12:12:13,398 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 91 [2019-09-08 12:12:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:13,398 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2019-09-08 12:12:13,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:12:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2019-09-08 12:12:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:12:13,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:13,399 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] [2019-09-08 12:12:13,399 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -767603588, now seen corresponding path program 1 times [2019-09-08 12:12:13,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:13,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:13,541 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:12:13,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:13,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:13,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:13,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:13,543 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand 9 states. [2019-09-08 12:12:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:14,322 INFO L93 Difference]: Finished difference Result 317 states and 389 transitions. [2019-09-08 12:12:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:12:14,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 12:12:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:14,324 INFO L225 Difference]: With dead ends: 317 [2019-09-08 12:12:14,324 INFO L226 Difference]: Without dead ends: 309 [2019-09-08 12:12:14,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:12:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-08 12:12:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 205. [2019-09-08 12:12:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-08 12:12:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2019-09-08 12:12:14,446 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 92 [2019-09-08 12:12:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:14,447 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2019-09-08 12:12:14,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2019-09-08 12:12:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:12:14,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:14,448 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] [2019-09-08 12:12:14,448 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1562795773, now seen corresponding path program 1 times [2019-09-08 12:12:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:14,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:15,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:15,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:12:15,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:12:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:12:15,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:12:15,127 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand 16 states. [2019-09-08 12:12:15,788 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:12:15,922 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:12:16,055 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:12:16,184 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:12:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:17,550 INFO L93 Difference]: Finished difference Result 638 states and 837 transitions. [2019-09-08 12:12:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:12:17,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2019-09-08 12:12:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:17,552 INFO L225 Difference]: With dead ends: 638 [2019-09-08 12:12:17,552 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 12:12:17,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:12:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 12:12:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 233. [2019-09-08 12:12:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-08 12:12:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2019-09-08 12:12:17,636 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 93 [2019-09-08 12:12:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:17,637 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2019-09-08 12:12:17,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:12:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2019-09-08 12:12:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:12:17,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:17,637 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -333235878, now seen corresponding path program 1 times [2019-09-08 12:12:17,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:18,036 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:12:18,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:18,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:12:18,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:12:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:12:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:12:18,037 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 12 states. [2019-09-08 12:12:18,453 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:12:18,575 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:12:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:19,643 INFO L93 Difference]: Finished difference Result 628 states and 826 transitions. [2019-09-08 12:12:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:12:19,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-09-08 12:12:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:19,645 INFO L225 Difference]: With dead ends: 628 [2019-09-08 12:12:19,645 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 12:12:19,645 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:12:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 12:12:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 199. [2019-09-08 12:12:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 12:12:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2019-09-08 12:12:19,733 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 94 [2019-09-08 12:12:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:19,733 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2019-09-08 12:12:19,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:12:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2019-09-08 12:12:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:12:19,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:19,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:19,734 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash -442414623, now seen corresponding path program 1 times [2019-09-08 12:12:19,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:19,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:19,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:20,803 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:12:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:12:20,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:12:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:12:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:12:20,804 INFO L87 Difference]: Start difference. First operand 199 states and 238 transitions. Second operand 22 states. [2019-09-08 12:12:21,597 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 12:12:21,818 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:12:22,103 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 12:12:22,285 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:12:22,469 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:12:22,640 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:12:22,785 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:12:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:25,020 INFO L93 Difference]: Finished difference Result 555 states and 704 transitions. [2019-09-08 12:12:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:12:25,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 94 [2019-09-08 12:12:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:25,021 INFO L225 Difference]: With dead ends: 555 [2019-09-08 12:12:25,022 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 12:12:25,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 12:12:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 12:12:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 211. [2019-09-08 12:12:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 12:12:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2019-09-08 12:12:25,146 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 94 [2019-09-08 12:12:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:25,147 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2019-09-08 12:12:25,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:12:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2019-09-08 12:12:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:12:25,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:25,147 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] [2019-09-08 12:12:25,148 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash 596288672, now seen corresponding path program 1 times [2019-09-08 12:12:25,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:25,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:25,676 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:12:25,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:25,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:12:25,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:12:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:12:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:12:25,678 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 15 states. [2019-09-08 12:12:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:27,028 INFO L93 Difference]: Finished difference Result 335 states and 410 transitions. [2019-09-08 12:12:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:12:27,028 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-09-08 12:12:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:27,029 INFO L225 Difference]: With dead ends: 335 [2019-09-08 12:12:27,029 INFO L226 Difference]: Without dead ends: 319 [2019-09-08 12:12:27,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:12:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-08 12:12:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 204. [2019-09-08 12:12:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-08 12:12:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2019-09-08 12:12:27,105 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 95 [2019-09-08 12:12:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:27,105 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2019-09-08 12:12:27,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:12:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2019-09-08 12:12:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:12:27,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:27,106 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] [2019-09-08 12:12:27,106 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1383966999, now seen corresponding path program 1 times [2019-09-08 12:12:27,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:27,512 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:12:27,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:27,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:12:27,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:12:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:12:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:12:27,513 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand 14 states. [2019-09-08 12:12:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:29,029 INFO L93 Difference]: Finished difference Result 475 states and 618 transitions. [2019-09-08 12:12:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:12:29,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2019-09-08 12:12:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:29,030 INFO L225 Difference]: With dead ends: 475 [2019-09-08 12:12:29,030 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 12:12:29,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:12:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 12:12:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 165. [2019-09-08 12:12:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-08 12:12:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2019-09-08 12:12:29,096 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 95 [2019-09-08 12:12:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:29,096 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2019-09-08 12:12:29,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:12:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2019-09-08 12:12:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:12:29,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:29,096 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:12:29,097 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash -467440922, now seen corresponding path program 1 times [2019-09-08 12:12:29,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:29,203 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:12:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:29,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:29,204 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 3 states. [2019-09-08 12:12:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:29,351 INFO L93 Difference]: Finished difference Result 291 states and 383 transitions. [2019-09-08 12:12:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:29,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:12:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:29,352 INFO L225 Difference]: With dead ends: 291 [2019-09-08 12:12:29,353 INFO L226 Difference]: Without dead ends: 226 [2019-09-08 12:12:29,353 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:12:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-08 12:12:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2019-09-08 12:12:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 12:12:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2019-09-08 12:12:29,466 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 122 [2019-09-08 12:12:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:29,467 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2019-09-08 12:12:29,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2019-09-08 12:12:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:29,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:29,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:29,468 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1042185839, now seen corresponding path program 1 times [2019-09-08 12:12:29,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:29,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:29,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:29,593 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:12:29,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:29,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:29,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:29,594 INFO L87 Difference]: Start difference. First operand 224 states and 286 transitions. Second operand 7 states. [2019-09-08 12:12:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:30,278 INFO L93 Difference]: Finished difference Result 612 states and 838 transitions. [2019-09-08 12:12:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:30,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:12:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:30,279 INFO L225 Difference]: With dead ends: 612 [2019-09-08 12:12:30,280 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 12:12:30,280 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:12:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 12:12:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 256. [2019-09-08 12:12:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 12:12:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 329 transitions. [2019-09-08 12:12:30,467 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 329 transitions. Word has length 124 [2019-09-08 12:12:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:30,467 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 329 transitions. [2019-09-08 12:12:30,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:12:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 329 transitions. [2019-09-08 12:12:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:30,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:30,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:30,468 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -611885514, now seen corresponding path program 1 times [2019-09-08 12:12:30,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:30,527 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:12:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:30,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:30,528 INFO L87 Difference]: Start difference. First operand 256 states and 329 transitions. Second operand 3 states. [2019-09-08 12:12:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:30,798 INFO L93 Difference]: Finished difference Result 550 states and 745 transitions. [2019-09-08 12:12:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:30,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:12:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:30,800 INFO L225 Difference]: With dead ends: 550 [2019-09-08 12:12:30,800 INFO L226 Difference]: Without dead ends: 394 [2019-09-08 12:12:30,800 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:12:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-08 12:12:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-09-08 12:12:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-08 12:12:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 517 transitions. [2019-09-08 12:12:31,046 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 517 transitions. Word has length 124 [2019-09-08 12:12:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:31,046 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 517 transitions. [2019-09-08 12:12:31,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 517 transitions. [2019-09-08 12:12:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:31,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:31,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:31,047 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:31,047 INFO L82 PathProgramCache]: Analyzing trace with hash -545392002, now seen corresponding path program 1 times [2019-09-08 12:12:31,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:31,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:31,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:31,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:31,143 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:12:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:31,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:31,144 INFO L87 Difference]: Start difference. First operand 392 states and 517 transitions. Second operand 3 states. [2019-09-08 12:12:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:31,533 INFO L93 Difference]: Finished difference Result 835 states and 1138 transitions. [2019-09-08 12:12:31,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:31,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:12:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:31,534 INFO L225 Difference]: With dead ends: 835 [2019-09-08 12:12:31,534 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 12:12:31,535 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:12:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 12:12:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2019-09-08 12:12:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 12:12:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 722 transitions. [2019-09-08 12:12:31,913 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 722 transitions. Word has length 124 [2019-09-08 12:12:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:31,913 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 722 transitions. [2019-09-08 12:12:31,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 722 transitions. [2019-09-08 12:12:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:31,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:31,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:31,914 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash -850819473, now seen corresponding path program 1 times [2019-09-08 12:12:31,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:31,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:32,011 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:12:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:32,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:32,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:32,013 INFO L87 Difference]: Start difference. First operand 541 states and 722 transitions. Second operand 7 states. [2019-09-08 12:12:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:33,766 INFO L93 Difference]: Finished difference Result 2181 states and 3006 transitions. [2019-09-08 12:12:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:33,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:12:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:33,768 INFO L225 Difference]: With dead ends: 2181 [2019-09-08 12:12:33,768 INFO L226 Difference]: Without dead ends: 1740 [2019-09-08 12:12:33,769 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:12:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-09-08 12:12:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1040. [2019-09-08 12:12:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-09-08 12:12:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1421 transitions. [2019-09-08 12:12:34,538 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1421 transitions. Word has length 124 [2019-09-08 12:12:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:34,538 INFO L475 AbstractCegarLoop]: Abstraction has 1040 states and 1421 transitions. [2019-09-08 12:12:34,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:12:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1421 transitions. [2019-09-08 12:12:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:34,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:34,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:34,540 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1444234351, now seen corresponding path program 1 times [2019-09-08 12:12:34,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:34,636 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:12:34,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:34,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:34,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:34,638 INFO L87 Difference]: Start difference. First operand 1040 states and 1421 transitions. Second operand 7 states. [2019-09-08 12:12:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:37,606 INFO L93 Difference]: Finished difference Result 4234 states and 5883 transitions. [2019-09-08 12:12:37,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:37,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:12:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:37,610 INFO L225 Difference]: With dead ends: 4234 [2019-09-08 12:12:37,610 INFO L226 Difference]: Without dead ends: 3294 [2019-09-08 12:12:37,611 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:12:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-09-08 12:12:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2098. [2019-09-08 12:12:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2019-09-08 12:12:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2903 transitions. [2019-09-08 12:12:39,222 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2903 transitions. Word has length 124 [2019-09-08 12:12:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:39,223 INFO L475 AbstractCegarLoop]: Abstraction has 2098 states and 2903 transitions. [2019-09-08 12:12:39,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:12:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2903 transitions. [2019-09-08 12:12:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:39,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:39,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:39,224 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -154008977, now seen corresponding path program 1 times [2019-09-08 12:12:39,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:39,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:39,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:39,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:39,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:39,325 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:12:39,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:39,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:39,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:39,326 INFO L87 Difference]: Start difference. First operand 2098 states and 2903 transitions. Second operand 7 states. [2019-09-08 12:12:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:45,256 INFO L93 Difference]: Finished difference Result 9198 states and 12855 transitions. [2019-09-08 12:12:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:45,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:12:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:45,264 INFO L225 Difference]: With dead ends: 9198 [2019-09-08 12:12:45,264 INFO L226 Difference]: Without dead ends: 7200 [2019-09-08 12:12:45,267 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:12:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-09-08 12:12:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 4334. [2019-09-08 12:12:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4334 states. [2019-09-08 12:12:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 6035 transitions. [2019-09-08 12:12:48,605 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 6035 transitions. Word has length 124 [2019-09-08 12:12:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:48,605 INFO L475 AbstractCegarLoop]: Abstraction has 4334 states and 6035 transitions. [2019-09-08 12:12:48,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:12:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 6035 transitions. [2019-09-08 12:12:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:48,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:48,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:48,607 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1325383791, now seen corresponding path program 1 times [2019-09-08 12:12:48,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:48,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:48,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:48,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:48,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:48,707 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:12:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:48,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:12:48,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:12:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:12:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:12:48,708 INFO L87 Difference]: Start difference. First operand 4334 states and 6035 transitions. Second operand 7 states. [2019-09-08 12:12:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:58,705 INFO L93 Difference]: Finished difference Result 16526 states and 23138 transitions. [2019-09-08 12:12:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:12:58,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-09-08 12:12:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:58,719 INFO L225 Difference]: With dead ends: 16526 [2019-09-08 12:12:58,719 INFO L226 Difference]: Without dead ends: 12292 [2019-09-08 12:12:58,726 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:12:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12292 states. [2019-09-08 12:13:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12292 to 7198. [2019-09-08 12:13:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7198 states. [2019-09-08 12:13:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 10043 transitions. [2019-09-08 12:13:04,155 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 10043 transitions. Word has length 124 [2019-09-08 12:13:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:04,155 INFO L475 AbstractCegarLoop]: Abstraction has 7198 states and 10043 transitions. [2019-09-08 12:13:04,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:13:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 10043 transitions. [2019-09-08 12:13:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:13:04,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:04,157 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:04,157 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1768680915, now seen corresponding path program 1 times [2019-09-08 12:13:04,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:04,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:04,218 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:13:04,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:04,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:04,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:04,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:04,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:04,219 INFO L87 Difference]: Start difference. First operand 7198 states and 10043 transitions. Second operand 3 states. [2019-09-08 12:13:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:09,352 INFO L93 Difference]: Finished difference Result 13866 states and 19333 transitions. [2019-09-08 12:13:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:09,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 12:13:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:09,359 INFO L225 Difference]: With dead ends: 13866 [2019-09-08 12:13:09,359 INFO L226 Difference]: Without dead ends: 6768 [2019-09-08 12:13:09,368 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:13:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-09-08 12:13:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 5154. [2019-09-08 12:13:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5154 states. [2019-09-08 12:13:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 7091 transitions. [2019-09-08 12:13:13,418 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 7091 transitions. Word has length 125 [2019-09-08 12:13:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:13,418 INFO L475 AbstractCegarLoop]: Abstraction has 5154 states and 7091 transitions. [2019-09-08 12:13:13,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 7091 transitions. [2019-09-08 12:13:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:13:13,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:13,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:13,420 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 233216673, now seen corresponding path program 1 times [2019-09-08 12:13:13,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:13,483 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:13:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:13,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:13,485 INFO L87 Difference]: Start difference. First operand 5154 states and 7091 transitions. Second operand 3 states. [2019-09-08 12:13:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:17,278 INFO L93 Difference]: Finished difference Result 9994 states and 13753 transitions. [2019-09-08 12:13:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:17,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 12:13:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:17,283 INFO L225 Difference]: With dead ends: 9994 [2019-09-08 12:13:17,283 INFO L226 Difference]: Without dead ends: 4940 [2019-09-08 12:13:17,288 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:13:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2019-09-08 12:13:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4602. [2019-09-08 12:13:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4602 states. [2019-09-08 12:13:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6305 transitions. [2019-09-08 12:13:20,856 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6305 transitions. Word has length 126 [2019-09-08 12:13:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:20,856 INFO L475 AbstractCegarLoop]: Abstraction has 4602 states and 6305 transitions. [2019-09-08 12:13:20,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6305 transitions. [2019-09-08 12:13:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:13:20,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:20,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:20,857 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1710481623, now seen corresponding path program 1 times [2019-09-08 12:13:20,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:20,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:20,920 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:13:20,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:20,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:20,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:20,921 INFO L87 Difference]: Start difference. First operand 4602 states and 6305 transitions. Second operand 3 states. [2019-09-08 12:13:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:24,852 INFO L93 Difference]: Finished difference Result 9574 states and 13161 transitions. [2019-09-08 12:13:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:24,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 12:13:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:24,859 INFO L225 Difference]: With dead ends: 9574 [2019-09-08 12:13:24,860 INFO L226 Difference]: Without dead ends: 5072 [2019-09-08 12:13:24,866 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:13:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-09-08 12:13:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5070. [2019-09-08 12:13:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5070 states. [2019-09-08 12:13:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5070 states to 5070 states and 6919 transitions. [2019-09-08 12:13:28,873 INFO L78 Accepts]: Start accepts. Automaton has 5070 states and 6919 transitions. Word has length 127 [2019-09-08 12:13:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:28,873 INFO L475 AbstractCegarLoop]: Abstraction has 5070 states and 6919 transitions. [2019-09-08 12:13:28,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5070 states and 6919 transitions. [2019-09-08 12:13:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:13:28,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:28,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:28,874 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -113713814, now seen corresponding path program 1 times [2019-09-08 12:13:28,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:28,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:28,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:28,968 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:13:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:13:28,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:13:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:13:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:13:28,969 INFO L87 Difference]: Start difference. First operand 5070 states and 6919 transitions. Second operand 6 states. [2019-09-08 12:13:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:35,030 INFO L93 Difference]: Finished difference Result 7625 states and 10356 transitions. [2019-09-08 12:13:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:13:35,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 12:13:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:35,040 INFO L225 Difference]: With dead ends: 7625 [2019-09-08 12:13:35,041 INFO L226 Difference]: Without dead ends: 7623 [2019-09-08 12:13:35,043 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:13:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2019-09-08 12:13:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 5124. [2019-09-08 12:13:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-09-08 12:13:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6955 transitions. [2019-09-08 12:13:39,125 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6955 transitions. Word has length 127 [2019-09-08 12:13:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:39,125 INFO L475 AbstractCegarLoop]: Abstraction has 5124 states and 6955 transitions. [2019-09-08 12:13:39,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:13:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6955 transitions. [2019-09-08 12:13:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:13:39,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:39,128 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2019-09-08 12:13:39,129 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -36770884, now seen corresponding path program 1 times [2019-09-08 12:13:39,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:39,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:39,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:13:39,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:13:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:13:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:13:39,221 INFO L87 Difference]: Start difference. First operand 5124 states and 6955 transitions. Second operand 3 states. [2019-09-08 12:13:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:45,911 INFO L93 Difference]: Finished difference Result 13600 states and 18561 transitions. [2019-09-08 12:13:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:13:45,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 12:13:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:45,919 INFO L225 Difference]: With dead ends: 13600 [2019-09-08 12:13:45,919 INFO L226 Difference]: Without dead ends: 8576 [2019-09-08 12:13:45,925 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:13:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2019-09-08 12:13:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 8094. [2019-09-08 12:13:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8094 states. [2019-09-08 12:13:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 11031 transitions. [2019-09-08 12:13:52,292 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 11031 transitions. Word has length 158 [2019-09-08 12:13:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:52,292 INFO L475 AbstractCegarLoop]: Abstraction has 8094 states and 11031 transitions. [2019-09-08 12:13:52,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:13:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 11031 transitions. [2019-09-08 12:13:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:13:52,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:52,296 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:13:52,296 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash 257185900, now seen corresponding path program 1 times [2019-09-08 12:13:52,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:52,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:52,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:52,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:52,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:13:52,446 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) [2019-09-08 12:13:52,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:13:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:13:52,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:13:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:13:53,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:13:53,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:13:53,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:13:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:13:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:13:53,041 INFO L87 Difference]: Start difference. First operand 8094 states and 11031 transitions. Second operand 11 states. [2019-09-08 12:15:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:08,593 INFO L93 Difference]: Finished difference Result 101796 states and 138699 transitions. [2019-09-08 12:15:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:15:08,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 12:15:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:08,965 INFO L225 Difference]: With dead ends: 101796 [2019-09-08 12:15:08,965 INFO L226 Difference]: Without dead ends: 93802 [2019-09-08 12:15:09,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:15:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93802 states. [2019-09-08 12:15:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93802 to 21174. [2019-09-08 12:15:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21174 states. [2019-09-08 12:15:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21174 states to 21174 states and 28831 transitions. [2019-09-08 12:15:27,205 INFO L78 Accepts]: Start accepts. Automaton has 21174 states and 28831 transitions. Word has length 159 [2019-09-08 12:15:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:27,205 INFO L475 AbstractCegarLoop]: Abstraction has 21174 states and 28831 transitions. [2019-09-08 12:15:27,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:15:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21174 states and 28831 transitions. [2019-09-08 12:15:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:15:27,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:27,213 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:15:27,214 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1635819412, now seen corresponding path program 1 times [2019-09-08 12:15:27,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:15:27,398 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) [2019-09-08 12:15:27,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:15:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:27,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:15:27,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:15:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:15:27,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:15:27,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:15:27,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:15:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:15:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:15:27,934 INFO L87 Difference]: Start difference. First operand 21174 states and 28831 transitions. Second operand 11 states. [2019-09-08 12:16:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:28,964 INFO L93 Difference]: Finished difference Result 95108 states and 129310 transitions. [2019-09-08 12:16:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:16:28,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-08 12:16:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:29,136 INFO L225 Difference]: With dead ends: 95108 [2019-09-08 12:16:29,136 INFO L226 Difference]: Without dead ends: 74034 [2019-09-08 12:16:29,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:16:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74034 states. [2019-09-08 12:16:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74034 to 32922. [2019-09-08 12:16:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32922 states. [2019-09-08 12:16:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32922 states to 32922 states and 44727 transitions. [2019-09-08 12:16:57,452 INFO L78 Accepts]: Start accepts. Automaton has 32922 states and 44727 transitions. Word has length 159 [2019-09-08 12:16:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:57,452 INFO L475 AbstractCegarLoop]: Abstraction has 32922 states and 44727 transitions. [2019-09-08 12:16:57,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:16:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32922 states and 44727 transitions. [2019-09-08 12:16:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:16:57,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:57,459 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1] [2019-09-08 12:16:57,460 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash 540383852, now seen corresponding path program 1 times [2019-09-08 12:16:57,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:57,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:57,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:57,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:57,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:57,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:57,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:57,570 INFO L87 Difference]: Start difference. First operand 32922 states and 44727 transitions. Second operand 3 states. [2019-09-08 12:17:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:23,508 INFO L93 Difference]: Finished difference Result 63172 states and 85437 transitions. [2019-09-08 12:17:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:23,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 12:17:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:23,548 INFO L225 Difference]: With dead ends: 63172 [2019-09-08 12:17:23,548 INFO L226 Difference]: Without dead ends: 30350 [2019-09-08 12:17:23,580 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:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30350 states. [2019-09-08 12:17:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30350 to 29520. [2019-09-08 12:17:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29520 states. [2019-09-08 12:17:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29520 states to 29520 states and 39471 transitions. [2019-09-08 12:17:50,062 INFO L78 Accepts]: Start accepts. Automaton has 29520 states and 39471 transitions. Word has length 159 [2019-09-08 12:17:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:50,062 INFO L475 AbstractCegarLoop]: Abstraction has 29520 states and 39471 transitions. [2019-09-08 12:17:50,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 29520 states and 39471 transitions. [2019-09-08 12:17:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:17:50,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:50,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:50,066 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash 705646096, now seen corresponding path program 1 times [2019-09-08 12:17:50,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:50,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:50,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:50,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:50,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:50,194 INFO L87 Difference]: Start difference. First operand 29520 states and 39471 transitions. Second operand 3 states. [2019-09-08 12:18:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:22,465 INFO L93 Difference]: Finished difference Result 65388 states and 87105 transitions. [2019-09-08 12:18:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:22,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:18:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:22,506 INFO L225 Difference]: With dead ends: 65388 [2019-09-08 12:18:22,506 INFO L226 Difference]: Without dead ends: 35968 [2019-09-08 12:18:22,534 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:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35968 states. [2019-09-08 12:18:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35968 to 34366. [2019-09-08 12:18:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34366 states. [2019-09-08 12:18:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34366 states to 34366 states and 45339 transitions. [2019-09-08 12:18:54,416 INFO L78 Accepts]: Start accepts. Automaton has 34366 states and 45339 transitions. Word has length 160 [2019-09-08 12:18:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:54,416 INFO L475 AbstractCegarLoop]: Abstraction has 34366 states and 45339 transitions. [2019-09-08 12:18:54,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34366 states and 45339 transitions. [2019-09-08 12:18:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:18:54,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:54,420 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:54,420 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1342590488, now seen corresponding path program 1 times [2019-09-08 12:18:54,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:54,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:54,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:18:54,821 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:18:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:55,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 2444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:18:55,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:18:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:18:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:18:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 12:18:55,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:18:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:18:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:18:55,423 INFO L87 Difference]: Start difference. First operand 34366 states and 45339 transitions. Second operand 16 states.