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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:44:22,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:44:22,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:44:22,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:44:22,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:44:22,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:44:22,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:44:22,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:44:22,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:44:22,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:44:22,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:44:22,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:44:22,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:44:22,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:44:22,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:44:22,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:44:22,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:44:22,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:44:22,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:44:22,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:44:22,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:44:22,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:44:22,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:44:22,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:44:22,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:44:22,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:44:22,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:44:22,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:44:22,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:44:22,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:44:22,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:44:22,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:44:22,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:44:22,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:44:22,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:44:22,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:44:22,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:44:22,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:44:22,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:44:22,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:44:22,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:44:22,780 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 11:44:22,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:44:22,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:44:22,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:44:22,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:44:22,811 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:44:22,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:44:22,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:44:22,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:44:22,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:44:22,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:44:22,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:44:22,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:44:22,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:44:22,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:44:22,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:44:22,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:44:22,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:44:22,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:44:22,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:44:22,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:44:22,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:44:22,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:44:22,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:44:22,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:44:22,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:44:22,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:44:22,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:44:22,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:44:22,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:44:22,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:44:22,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:44:22,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:44:22,896 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:44:22,897 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:44:22,897 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:44:22,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ef08a76/7828de5a15944aa989ab58cda389f6cb/FLAGb804b41af [2019-09-08 11:44:23,663 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:44:23,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:44:23,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ef08a76/7828de5a15944aa989ab58cda389f6cb/FLAGb804b41af [2019-09-08 11:44:23,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ef08a76/7828de5a15944aa989ab58cda389f6cb [2019-09-08 11:44:23,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:44:23,836 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:44:23,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:44:23,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:44:23,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:44:23,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:44:23" (1/1) ... [2019-09-08 11:44:23,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c54f8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:23, skipping insertion in model container [2019-09-08 11:44:23,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:44:23" (1/1) ... [2019-09-08 11:44:23,854 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:44:23,960 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:44:24,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:44:24,849 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:44:25,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:44:25,117 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:44:25,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25 WrapperNode [2019-09-08 11:44:25,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:44:25,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:44:25,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:44:25,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:44:25,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (1/1) ... [2019-09-08 11:44:25,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:44:25,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:44:25,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:44:25,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:44:25,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (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 11:44:25,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:44:25,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:44:25,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:44:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:44:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:44:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:44:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:44:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:44:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:44:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:44:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:44:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:44:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:44:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:44:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:44:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:44:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:44:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:44:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:44:27,871 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:44:27,871 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:44:27,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:44:27 BoogieIcfgContainer [2019-09-08 11:44:27,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:44:27,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:44:27,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:44:27,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:44:27,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:44:23" (1/3) ... [2019-09-08 11:44:27,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405a1ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:44:27, skipping insertion in model container [2019-09-08 11:44:27,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:44:25" (2/3) ... [2019-09-08 11:44:27,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405a1ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:44:27, skipping insertion in model container [2019-09-08 11:44:27,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:44:27" (3/3) ... [2019-09-08 11:44:27,881 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:44:27,891 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:44:27,900 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:44:27,917 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:44:27,961 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:44:27,961 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:44:27,962 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:44:27,962 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:44:27,962 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:44:27,962 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:44:27,962 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:44:27,962 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:44:27,962 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:44:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-09-08 11:44:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:44:28,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:28,034 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] [2019-09-08 11:44:28,036 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash -45640292, now seen corresponding path program 1 times [2019-09-08 11:44:28,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:28,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:28,650 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 11:44:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:28,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:44:28,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:44:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:44:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:44:28,675 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 6 states. [2019-09-08 11:44:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:29,658 INFO L93 Difference]: Finished difference Result 906 states and 1509 transitions. [2019-09-08 11:44:29,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:44:29,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-08 11:44:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:29,690 INFO L225 Difference]: With dead ends: 906 [2019-09-08 11:44:29,690 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 11:44:29,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:44:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 11:44:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 575. [2019-09-08 11:44:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 11:44:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 729 transitions. [2019-09-08 11:44:29,839 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 729 transitions. Word has length 64 [2019-09-08 11:44:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:29,840 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 729 transitions. [2019-09-08 11:44:29,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:44:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 729 transitions. [2019-09-08 11:44:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:44:29,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:29,847 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] [2019-09-08 11:44:29,847 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1649351166, now seen corresponding path program 1 times [2019-09-08 11:44:29,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:29,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:29,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:29,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:30,095 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 11:44:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:44:30,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:44:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:44:30,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:44:30,098 INFO L87 Difference]: Start difference. First operand 575 states and 729 transitions. Second operand 5 states. [2019-09-08 11:44:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:30,484 INFO L93 Difference]: Finished difference Result 724 states and 930 transitions. [2019-09-08 11:44:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:44:30,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:44:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:30,488 INFO L225 Difference]: With dead ends: 724 [2019-09-08 11:44:30,489 INFO L226 Difference]: Without dead ends: 423 [2019-09-08 11:44:30,491 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 11:44:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-08 11:44:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-09-08 11:44:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 11:44:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 535 transitions. [2019-09-08 11:44:30,513 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 535 transitions. Word has length 64 [2019-09-08 11:44:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:30,514 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 535 transitions. [2019-09-08 11:44:30,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:44:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 535 transitions. [2019-09-08 11:44:30,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:44:30,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:30,516 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] [2019-09-08 11:44:30,517 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1630759173, now seen corresponding path program 1 times [2019-09-08 11:44:30,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:30,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:30,679 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 11:44:30,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:30,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:44:30,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:44:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:44:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:44:30,681 INFO L87 Difference]: Start difference. First operand 423 states and 535 transitions. Second operand 5 states. [2019-09-08 11:44:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:31,084 INFO L93 Difference]: Finished difference Result 842 states and 1099 transitions. [2019-09-08 11:44:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:44:31,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:44:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:31,090 INFO L225 Difference]: With dead ends: 842 [2019-09-08 11:44:31,091 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 11:44:31,092 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 11:44:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 11:44:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2019-09-08 11:44:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 11:44:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 721 transitions. [2019-09-08 11:44:31,131 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 721 transitions. Word has length 64 [2019-09-08 11:44:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:31,134 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 721 transitions. [2019-09-08 11:44:31,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:44:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 721 transitions. [2019-09-08 11:44:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:44:31,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:31,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] [2019-09-08 11:44:31,137 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1724870339, now seen corresponding path program 1 times [2019-09-08 11:44:31,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:31,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:31,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:31,292 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 11:44:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:44:31,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:44:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:44:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:44:31,295 INFO L87 Difference]: Start difference. First operand 541 states and 721 transitions. Second operand 5 states. [2019-09-08 11:44:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:31,547 INFO L93 Difference]: Finished difference Result 846 states and 1145 transitions. [2019-09-08 11:44:31,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:44:31,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 11:44:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:31,551 INFO L225 Difference]: With dead ends: 846 [2019-09-08 11:44:31,551 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 11:44:31,552 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 11:44:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 11:44:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-08 11:44:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2019-09-08 11:44:31,581 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 66 [2019-09-08 11:44:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:31,582 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2019-09-08 11:44:31,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:44:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2019-09-08 11:44:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:44:31,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:31,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] [2019-09-08 11:44:31,584 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash 726626472, now seen corresponding path program 1 times [2019-09-08 11:44:31,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:31,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:31,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:31,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 11:44:31,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:31,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:44:31,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:44:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:44:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:44:31,859 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand 8 states. [2019-09-08 11:44:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:32,442 INFO L93 Difference]: Finished difference Result 1144 states and 1579 transitions. [2019-09-08 11:44:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:44:32,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-08 11:44:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:32,448 INFO L225 Difference]: With dead ends: 1144 [2019-09-08 11:44:32,448 INFO L226 Difference]: Without dead ends: 841 [2019-09-08 11:44:32,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:44:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-08 11:44:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 488. [2019-09-08 11:44:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 650 transitions. [2019-09-08 11:44:32,485 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 650 transitions. Word has length 68 [2019-09-08 11:44:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:32,486 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 650 transitions. [2019-09-08 11:44:32,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:44:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 650 transitions. [2019-09-08 11:44:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:44:32,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:32,487 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] [2019-09-08 11:44:32,488 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461784, now seen corresponding path program 1 times [2019-09-08 11:44:32,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:32,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:32,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:32,639 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 11:44:32,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:32,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:32,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:32,641 INFO L87 Difference]: Start difference. First operand 488 states and 650 transitions. Second operand 9 states. [2019-09-08 11:44:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:34,090 INFO L93 Difference]: Finished difference Result 1280 states and 1818 transitions. [2019-09-08 11:44:34,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:44:34,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:44:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:34,098 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 11:44:34,098 INFO L226 Difference]: Without dead ends: 1029 [2019-09-08 11:44:34,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:44:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-08 11:44:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 488. [2019-09-08 11:44:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 649 transitions. [2019-09-08 11:44:34,141 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 649 transitions. Word has length 68 [2019-09-08 11:44:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:34,142 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 649 transitions. [2019-09-08 11:44:34,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 649 transitions. [2019-09-08 11:44:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:44:34,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:34,144 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] [2019-09-08 11:44:34,145 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1312203704, now seen corresponding path program 1 times [2019-09-08 11:44:34,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:34,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:34,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 11:44:34,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:34,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:34,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:34,343 INFO L87 Difference]: Start difference. First operand 488 states and 649 transitions. Second operand 9 states. [2019-09-08 11:44:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:35,472 INFO L93 Difference]: Finished difference Result 1483 states and 2092 transitions. [2019-09-08 11:44:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:35,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:44:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:35,480 INFO L225 Difference]: With dead ends: 1483 [2019-09-08 11:44:35,480 INFO L226 Difference]: Without dead ends: 1261 [2019-09-08 11:44:35,482 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 11:44:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-08 11:44:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-08 11:44:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 648 transitions. [2019-09-08 11:44:35,524 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 648 transitions. Word has length 68 [2019-09-08 11:44:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:35,525 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 648 transitions. [2019-09-08 11:44:35,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 648 transitions. [2019-09-08 11:44:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:44:35,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:35,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:44:35,527 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1888529039, now seen corresponding path program 1 times [2019-09-08 11:44:35,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:35,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:35,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:35,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:35,681 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 11:44:35,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:35,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:35,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:35,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:35,683 INFO L87 Difference]: Start difference. First operand 488 states and 648 transitions. Second operand 9 states. [2019-09-08 11:44:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:37,022 INFO L93 Difference]: Finished difference Result 1446 states and 2036 transitions. [2019-09-08 11:44:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:37,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:44:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:37,029 INFO L225 Difference]: With dead ends: 1446 [2019-09-08 11:44:37,029 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 11:44:37,030 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 11:44:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 11:44:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-08 11:44:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 647 transitions. [2019-09-08 11:44:37,076 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 647 transitions. Word has length 69 [2019-09-08 11:44:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:37,077 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 647 transitions. [2019-09-08 11:44:37,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 647 transitions. [2019-09-08 11:44:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:37,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:37,078 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] [2019-09-08 11:44:37,079 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash 251258957, now seen corresponding path program 1 times [2019-09-08 11:44:37,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:37,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:37,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:37,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:37,230 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 11:44:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:37,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:37,232 INFO L87 Difference]: Start difference. First operand 488 states and 647 transitions. Second operand 9 states. [2019-09-08 11:44:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:38,470 INFO L93 Difference]: Finished difference Result 1280 states and 1781 transitions. [2019-09-08 11:44:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:38,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:38,477 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 11:44:38,478 INFO L226 Difference]: Without dead ends: 1261 [2019-09-08 11:44:38,479 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 11:44:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-08 11:44:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-08 11:44:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 645 transitions. [2019-09-08 11:44:38,527 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 645 transitions. Word has length 70 [2019-09-08 11:44:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:38,527 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 645 transitions. [2019-09-08 11:44:38,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 645 transitions. [2019-09-08 11:44:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:38,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:38,529 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] [2019-09-08 11:44:38,530 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 120874925, now seen corresponding path program 1 times [2019-09-08 11:44:38,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:38,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:38,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:38,680 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 11:44:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:38,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:38,682 INFO L87 Difference]: Start difference. First operand 488 states and 645 transitions. Second operand 9 states. [2019-09-08 11:44:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:39,924 INFO L93 Difference]: Finished difference Result 1241 states and 1722 transitions. [2019-09-08 11:44:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:39,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:39,933 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 11:44:39,934 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 11:44:39,934 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 11:44:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 11:44:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-08 11:44:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 643 transitions. [2019-09-08 11:44:40,026 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 643 transitions. Word has length 70 [2019-09-08 11:44:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:40,027 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 643 transitions. [2019-09-08 11:44:40,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 643 transitions. [2019-09-08 11:44:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:40,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:40,028 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] [2019-09-08 11:44:40,029 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1647730477, now seen corresponding path program 1 times [2019-09-08 11:44:40,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:40,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:40,205 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 11:44:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:40,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:40,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:40,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:40,207 INFO L87 Difference]: Start difference. First operand 488 states and 643 transitions. Second operand 9 states. [2019-09-08 11:44:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:41,326 INFO L93 Difference]: Finished difference Result 1324 states and 1863 transitions. [2019-09-08 11:44:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:44:41,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:41,337 INFO L225 Difference]: With dead ends: 1324 [2019-09-08 11:44:41,337 INFO L226 Difference]: Without dead ends: 1029 [2019-09-08 11:44:41,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:44:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-08 11:44:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 488. [2019-09-08 11:44:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 641 transitions. [2019-09-08 11:44:41,401 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 641 transitions. Word has length 70 [2019-09-08 11:44:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:41,401 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 641 transitions. [2019-09-08 11:44:41,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2019-09-08 11:44:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:41,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:41,403 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] [2019-09-08 11:44:41,404 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1135659117, now seen corresponding path program 1 times [2019-09-08 11:44:41,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:41,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:41,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:41,675 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 11:44:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:41,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:41,678 INFO L87 Difference]: Start difference. First operand 488 states and 641 transitions. Second operand 9 states. [2019-09-08 11:44:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:43,207 INFO L93 Difference]: Finished difference Result 1241 states and 1718 transitions. [2019-09-08 11:44:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:43,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:43,214 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 11:44:43,215 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 11:44:43,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:44:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 11:44:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-08 11:44:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 640 transitions. [2019-09-08 11:44:43,290 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 640 transitions. Word has length 70 [2019-09-08 11:44:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:43,290 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 640 transitions. [2019-09-08 11:44:43,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 640 transitions. [2019-09-08 11:44:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:43,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:43,291 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] [2019-09-08 11:44:43,292 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1963584653, now seen corresponding path program 1 times [2019-09-08 11:44:43,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:43,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:43,447 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 11:44:43,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:43,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:43,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:43,448 INFO L87 Difference]: Start difference. First operand 488 states and 640 transitions. Second operand 9 states. [2019-09-08 11:44:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:44,500 INFO L93 Difference]: Finished difference Result 1449 states and 2030 transitions. [2019-09-08 11:44:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:44,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:44,507 INFO L225 Difference]: With dead ends: 1449 [2019-09-08 11:44:44,507 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 11:44:44,508 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 11:44:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 11:44:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-08 11:44:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 639 transitions. [2019-09-08 11:44:44,568 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 639 transitions. Word has length 70 [2019-09-08 11:44:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:44,568 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 639 transitions. [2019-09-08 11:44:44,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 639 transitions. [2019-09-08 11:44:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:44:44,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:44,570 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] [2019-09-08 11:44:44,570 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash -483426451, now seen corresponding path program 1 times [2019-09-08 11:44:44,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:44,708 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 11:44:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:44,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:44:44,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:44:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:44:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:44:44,709 INFO L87 Difference]: Start difference. First operand 488 states and 639 transitions. Second operand 9 states. [2019-09-08 11:44:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:45,922 INFO L93 Difference]: Finished difference Result 1488 states and 2086 transitions. [2019-09-08 11:44:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:44:45,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:44:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:45,929 INFO L225 Difference]: With dead ends: 1488 [2019-09-08 11:44:45,929 INFO L226 Difference]: Without dead ends: 1261 [2019-09-08 11:44:45,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:44:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-08 11:44:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-08 11:44:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:44:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 638 transitions. [2019-09-08 11:44:45,993 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 638 transitions. Word has length 70 [2019-09-08 11:44:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:45,994 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 638 transitions. [2019-09-08 11:44:45,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:44:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 638 transitions. [2019-09-08 11:44:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:44:45,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:45,995 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] [2019-09-08 11:44:45,996 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 13599436, now seen corresponding path program 1 times [2019-09-08 11:44:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:45,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:46,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 11:44:46,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:46,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:44:46,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:44:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:44:46,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:44:46,928 INFO L87 Difference]: Start difference. First operand 488 states and 638 transitions. Second operand 16 states. [2019-09-08 11:44:47,709 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:44:47,860 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:44:48,003 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:44:48,132 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:44:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:49,811 INFO L93 Difference]: Finished difference Result 1408 states and 1924 transitions. [2019-09-08 11:44:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:44:49,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 11:44:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:49,819 INFO L225 Difference]: With dead ends: 1408 [2019-09-08 11:44:49,820 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:44:49,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:44:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:44:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 487. [2019-09-08 11:44:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-08 11:44:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 636 transitions. [2019-09-08 11:44:49,907 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 636 transitions. Word has length 71 [2019-09-08 11:44:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:49,907 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 636 transitions. [2019-09-08 11:44:49,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:44:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 636 transitions. [2019-09-08 11:44:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:44:49,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:49,909 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] [2019-09-08 11:44:49,909 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1414423564, now seen corresponding path program 1 times [2019-09-08 11:44:49,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:50,769 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 11:44:50,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:50,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:44:50,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:44:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:44:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:44:50,771 INFO L87 Difference]: Start difference. First operand 487 states and 636 transitions. Second operand 17 states. [2019-09-08 11:44:51,427 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:44:51,575 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:44:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:52,887 INFO L93 Difference]: Finished difference Result 1172 states and 1641 transitions. [2019-09-08 11:44:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:44:52,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-08 11:44:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:52,892 INFO L225 Difference]: With dead ends: 1172 [2019-09-08 11:44:52,893 INFO L226 Difference]: Without dead ends: 937 [2019-09-08 11:44:52,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:44:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-08 11:44:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 475. [2019-09-08 11:44:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-08 11:44:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 620 transitions. [2019-09-08 11:44:52,976 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 620 transitions. Word has length 71 [2019-09-08 11:44:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:52,976 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 620 transitions. [2019-09-08 11:44:52,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:44:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2019-09-08 11:44:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:44:52,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:52,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:44:52,978 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1732820084, now seen corresponding path program 1 times [2019-09-08 11:44:52,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:52,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:52,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:52,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:52,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:53,621 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 11:44:53,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:53,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:44:53,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:44:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:44:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:44:53,622 INFO L87 Difference]: Start difference. First operand 475 states and 620 transitions. Second operand 14 states. [2019-09-08 11:44:54,193 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-08 11:44:54,320 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:44:54,448 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:44:54,583 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 11:44:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:55,594 INFO L93 Difference]: Finished difference Result 1105 states and 1541 transitions. [2019-09-08 11:44:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:44:55,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-08 11:44:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:55,598 INFO L225 Difference]: With dead ends: 1105 [2019-09-08 11:44:55,599 INFO L226 Difference]: Without dead ends: 834 [2019-09-08 11:44:55,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:44:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-08 11:44:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 456. [2019-09-08 11:44:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 11:44:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-08 11:44:55,668 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 71 [2019-09-08 11:44:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:55,669 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-08 11:44:55,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:44:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-08 11:44:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:44:55,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:55,670 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] [2019-09-08 11:44:55,671 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1601198802, now seen corresponding path program 1 times [2019-09-08 11:44:55,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:55,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:55,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:55,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:57,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 11:44:57,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:44:57,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:44:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:44:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:44:57,038 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 20 states. [2019-09-08 11:44:57,202 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:44:57,632 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 11:44:57,793 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 11:44:58,064 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:44:58,344 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:44:58,663 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 11:44:58,910 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 11:44:59,153 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 11:45:00,134 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 11:45:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:01,144 INFO L93 Difference]: Finished difference Result 1022 states and 1400 transitions. [2019-09-08 11:45:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:45:01,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-08 11:45:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:01,147 INFO L225 Difference]: With dead ends: 1022 [2019-09-08 11:45:01,148 INFO L226 Difference]: Without dead ends: 810 [2019-09-08 11:45:01,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:45:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-08 11:45:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 467. [2019-09-08 11:45:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-08 11:45:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 614 transitions. [2019-09-08 11:45:01,228 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 614 transitions. Word has length 72 [2019-09-08 11:45:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:01,229 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 614 transitions. [2019-09-08 11:45:01,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:45:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 614 transitions. [2019-09-08 11:45:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:45:01,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:01,230 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] [2019-09-08 11:45:01,231 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1134979118, now seen corresponding path program 1 times [2019-09-08 11:45:01,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:01,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:01,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:01,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:01,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:02,556 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 11:45:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:45:02,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:45:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:45:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:45:02,558 INFO L87 Difference]: Start difference. First operand 467 states and 614 transitions. Second operand 21 states. [2019-09-08 11:45:02,702 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 11:45:03,182 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 11:45:03,341 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:45:03,518 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:45:03,707 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:45:03,983 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 11:45:04,323 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 11:45:04,537 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:45:04,741 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:45:04,937 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:45:05,216 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:45:05,440 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:45:05,637 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:45:05,884 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:45:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:07,143 INFO L93 Difference]: Finished difference Result 935 states and 1245 transitions. [2019-09-08 11:45:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:45:07,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-08 11:45:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:07,146 INFO L225 Difference]: With dead ends: 935 [2019-09-08 11:45:07,146 INFO L226 Difference]: Without dead ends: 928 [2019-09-08 11:45:07,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:45:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-08 11:45:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 467. [2019-09-08 11:45:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-08 11:45:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 613 transitions. [2019-09-08 11:45:07,229 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 613 transitions. Word has length 72 [2019-09-08 11:45:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:07,230 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 613 transitions. [2019-09-08 11:45:07,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:45:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 613 transitions. [2019-09-08 11:45:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:45:07,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:07,232 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] [2019-09-08 11:45:07,232 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -325456334, now seen corresponding path program 1 times [2019-09-08 11:45:07,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:07,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:07,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:08,137 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 11:45:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:45:08,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:45:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:45:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:45:08,141 INFO L87 Difference]: Start difference. First operand 467 states and 613 transitions. Second operand 17 states. [2019-09-08 11:45:08,804 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:45:08,949 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:45:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:09,528 INFO L93 Difference]: Finished difference Result 804 states and 1107 transitions. [2019-09-08 11:45:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:45:09,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-09-08 11:45:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:09,537 INFO L225 Difference]: With dead ends: 804 [2019-09-08 11:45:09,537 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 11:45:09,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:45:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 11:45:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 447. [2019-09-08 11:45:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 11:45:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 588 transitions. [2019-09-08 11:45:09,633 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 588 transitions. Word has length 72 [2019-09-08 11:45:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:09,633 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 588 transitions. [2019-09-08 11:45:09,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:45:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 588 transitions. [2019-09-08 11:45:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:45:09,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:09,634 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] [2019-09-08 11:45:09,635 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -535876087, now seen corresponding path program 1 times [2019-09-08 11:45:09,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:09,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:10,283 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 11:45:10,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:10,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:45:10,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:45:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:45:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:45:10,287 INFO L87 Difference]: Start difference. First operand 447 states and 588 transitions. Second operand 16 states. [2019-09-08 11:45:11,236 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 11:45:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:12,263 INFO L93 Difference]: Finished difference Result 1301 states and 1861 transitions. [2019-09-08 11:45:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:45:12,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-09-08 11:45:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:12,269 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 11:45:12,269 INFO L226 Difference]: Without dead ends: 1076 [2019-09-08 11:45:12,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:45:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-08 11:45:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 430. [2019-09-08 11:45:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-08 11:45:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 567 transitions. [2019-09-08 11:45:12,359 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 567 transitions. Word has length 72 [2019-09-08 11:45:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:12,360 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 567 transitions. [2019-09-08 11:45:12,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:45:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 567 transitions. [2019-09-08 11:45:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:45:12,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:12,361 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] [2019-09-08 11:45:12,361 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1933470062, now seen corresponding path program 1 times [2019-09-08 11:45:12,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:12,726 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 11:45:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:45:12,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:45:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:45:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:45:12,728 INFO L87 Difference]: Start difference. First operand 430 states and 567 transitions. Second operand 11 states. [2019-09-08 11:45:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:13,554 INFO L93 Difference]: Finished difference Result 927 states and 1280 transitions. [2019-09-08 11:45:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:45:13,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-08 11:45:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:13,560 INFO L225 Difference]: With dead ends: 927 [2019-09-08 11:45:13,560 INFO L226 Difference]: Without dead ends: 923 [2019-09-08 11:45:13,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:45:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-08 11:45:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 426. [2019-09-08 11:45:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 11:45:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 563 transitions. [2019-09-08 11:45:13,631 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 563 transitions. Word has length 73 [2019-09-08 11:45:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:13,631 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 563 transitions. [2019-09-08 11:45:13,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:45:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 563 transitions. [2019-09-08 11:45:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:45:13,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:13,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:13,632 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2086852327, now seen corresponding path program 1 times [2019-09-08 11:45:13,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:13,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:14,175 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 11:45:14,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:14,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:45:14,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:45:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:45:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:45:14,176 INFO L87 Difference]: Start difference. First operand 426 states and 563 transitions. Second operand 12 states. [2019-09-08 11:45:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:15,789 INFO L93 Difference]: Finished difference Result 2461 states and 3561 transitions. [2019-09-08 11:45:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:45:15,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 11:45:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:15,797 INFO L225 Difference]: With dead ends: 2461 [2019-09-08 11:45:15,797 INFO L226 Difference]: Without dead ends: 2226 [2019-09-08 11:45:15,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:45:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-09-08 11:45:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 392. [2019-09-08 11:45:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-08 11:45:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 516 transitions. [2019-09-08 11:45:15,935 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 516 transitions. Word has length 73 [2019-09-08 11:45:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:15,936 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 516 transitions. [2019-09-08 11:45:15,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:45:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 516 transitions. [2019-09-08 11:45:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:45:15,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:15,937 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] [2019-09-08 11:45:15,938 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1799415509, now seen corresponding path program 1 times [2019-09-08 11:45:15,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:15,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:15,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:16,581 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-08 11:45:16,726 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 11:45:16,863 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 11:45:16,985 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 11:45:17,931 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 11:45:17,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:17,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:45:17,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:45:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:45:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:45:17,933 INFO L87 Difference]: Start difference. First operand 392 states and 516 transitions. Second operand 21 states. [2019-09-08 11:45:18,181 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:45:18,404 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-08 11:45:18,580 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 11:45:18,775 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:45:19,011 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 11:45:19,413 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 11:45:19,781 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 11:45:20,272 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-08 11:45:20,735 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 11:45:21,208 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 11:45:21,690 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 11:45:22,267 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-08 11:45:22,688 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:45:23,098 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:45:23,432 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 11:45:23,722 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:45:24,127 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 11:45:24,450 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:45:24,654 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 11:45:25,082 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 11:45:25,637 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:45:25,995 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 11:45:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:26,526 INFO L93 Difference]: Finished difference Result 1482 states and 2129 transitions. [2019-09-08 11:45:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:45:26,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2019-09-08 11:45:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:26,530 INFO L225 Difference]: With dead ends: 1482 [2019-09-08 11:45:26,530 INFO L226 Difference]: Without dead ends: 1270 [2019-09-08 11:45:26,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:45:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-08 11:45:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 388. [2019-09-08 11:45:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:45:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 511 transitions. [2019-09-08 11:45:26,661 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 511 transitions. Word has length 73 [2019-09-08 11:45:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:26,661 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 511 transitions. [2019-09-08 11:45:26,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:45:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 511 transitions. [2019-09-08 11:45:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:45:26,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:26,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:26,663 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:26,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982386, now seen corresponding path program 1 times [2019-09-08 11:45:26,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:26,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:26,801 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 11:45:26,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:26,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:45:26,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:45:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:45:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:45:26,803 INFO L87 Difference]: Start difference. First operand 388 states and 511 transitions. Second operand 9 states. [2019-09-08 11:45:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:27,580 INFO L93 Difference]: Finished difference Result 928 states and 1275 transitions. [2019-09-08 11:45:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:45:27,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-08 11:45:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:27,583 INFO L225 Difference]: With dead ends: 928 [2019-09-08 11:45:27,583 INFO L226 Difference]: Without dead ends: 670 [2019-09-08 11:45:27,584 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 11:45:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-08 11:45:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 388. [2019-09-08 11:45:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:45:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 509 transitions. [2019-09-08 11:45:27,667 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 509 transitions. Word has length 74 [2019-09-08 11:45:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:27,668 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 509 transitions. [2019-09-08 11:45:27,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:45:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 509 transitions. [2019-09-08 11:45:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:45:27,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:27,669 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] [2019-09-08 11:45:27,669 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:27,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2063860178, now seen corresponding path program 1 times [2019-09-08 11:45:27,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:27,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:27,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:27,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:27,846 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 11:45:27,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:27,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:45:27,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:45:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:45:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:45:27,848 INFO L87 Difference]: Start difference. First operand 388 states and 509 transitions. Second operand 9 states. [2019-09-08 11:45:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:29,132 INFO L93 Difference]: Finished difference Result 892 states and 1228 transitions. [2019-09-08 11:45:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:45:29,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:45:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:29,136 INFO L225 Difference]: With dead ends: 892 [2019-09-08 11:45:29,137 INFO L226 Difference]: Without dead ends: 884 [2019-09-08 11:45:29,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:45:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-08 11:45:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 388. [2019-09-08 11:45:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:45:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 508 transitions. [2019-09-08 11:45:29,225 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 508 transitions. Word has length 75 [2019-09-08 11:45:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:29,226 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 508 transitions. [2019-09-08 11:45:29,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:45:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 508 transitions. [2019-09-08 11:45:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:45:29,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:29,227 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] [2019-09-08 11:45:29,227 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1495566453, now seen corresponding path program 1 times [2019-09-08 11:45:29,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:29,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:29,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:29,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:29,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:29,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 11:45:29,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:29,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:45:29,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:45:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:45:29,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:45:29,359 INFO L87 Difference]: Start difference. First operand 388 states and 508 transitions. Second operand 9 states. [2019-09-08 11:45:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:30,148 INFO L93 Difference]: Finished difference Result 680 states and 910 transitions. [2019-09-08 11:45:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:45:30,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:45:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:30,152 INFO L225 Difference]: With dead ends: 680 [2019-09-08 11:45:30,152 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 11:45:30,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:45:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 11:45:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 388. [2019-09-08 11:45:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 11:45:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 507 transitions. [2019-09-08 11:45:30,244 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 507 transitions. Word has length 75 [2019-09-08 11:45:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:30,244 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 507 transitions. [2019-09-08 11:45:30,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:45:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2019-09-08 11:45:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:45:30,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:30,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:30,246 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:30,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:30,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1970985129, now seen corresponding path program 1 times [2019-09-08 11:45:30,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:30,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:30,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:30,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:30,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 11:45:30,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:30,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:45:30,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:45:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:45:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:45:30,948 INFO L87 Difference]: Start difference. First operand 388 states and 507 transitions. Second operand 21 states. [2019-09-08 11:45:31,146 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:45:31,918 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-08 11:45:32,095 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 11:45:32,289 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 11:45:32,447 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 11:45:32,596 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 11:45:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:35,536 INFO L93 Difference]: Finished difference Result 2127 states and 3087 transitions. [2019-09-08 11:45:35,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:45:35,536 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 11:45:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:35,540 INFO L225 Difference]: With dead ends: 2127 [2019-09-08 11:45:35,540 INFO L226 Difference]: Without dead ends: 1905 [2019-09-08 11:45:35,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:45:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-09-08 11:45:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 401. [2019-09-08 11:45:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-08 11:45:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 522 transitions. [2019-09-08 11:45:35,665 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 522 transitions. Word has length 76 [2019-09-08 11:45:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:35,666 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 522 transitions. [2019-09-08 11:45:35,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:45:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 522 transitions. [2019-09-08 11:45:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:45:35,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:35,667 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 11:45:35,668 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:35,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1254231081, now seen corresponding path program 1 times [2019-09-08 11:45:35,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:35,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:35,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:35,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:35,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:36,099 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 11:45:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:45:36,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:45:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:45:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:45:36,102 INFO L87 Difference]: Start difference. First operand 401 states and 522 transitions. Second operand 12 states. [2019-09-08 11:45:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:37,347 INFO L93 Difference]: Finished difference Result 1115 states and 1557 transitions. [2019-09-08 11:45:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:45:37,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-09-08 11:45:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:37,349 INFO L225 Difference]: With dead ends: 1115 [2019-09-08 11:45:37,349 INFO L226 Difference]: Without dead ends: 1109 [2019-09-08 11:45:37,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:45:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-08 11:45:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 394. [2019-09-08 11:45:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 11:45:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 514 transitions. [2019-09-08 11:45:37,474 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 514 transitions. Word has length 77 [2019-09-08 11:45:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:37,474 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 514 transitions. [2019-09-08 11:45:37,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:45:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 514 transitions. [2019-09-08 11:45:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:45:37,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:37,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:37,476 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1521511757, now seen corresponding path program 1 times [2019-09-08 11:45:37,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:37,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:45:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:45:37,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:45:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:45:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:45:37,952 INFO L87 Difference]: Start difference. First operand 394 states and 514 transitions. Second operand 13 states. [2019-09-08 11:45:38,530 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-08 11:45:38,673 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-08 11:45:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:39,309 INFO L93 Difference]: Finished difference Result 864 states and 1199 transitions. [2019-09-08 11:45:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:45:39,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-08 11:45:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:39,311 INFO L225 Difference]: With dead ends: 864 [2019-09-08 11:45:39,311 INFO L226 Difference]: Without dead ends: 844 [2019-09-08 11:45:39,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:45:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-09-08 11:45:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 374. [2019-09-08 11:45:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-08 11:45:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 492 transitions. [2019-09-08 11:45:39,469 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 492 transitions. Word has length 77 [2019-09-08 11:45:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:39,469 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 492 transitions. [2019-09-08 11:45:39,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:45:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2019-09-08 11:45:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:45:39,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:39,470 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 11:45:39,471 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2017824198, now seen corresponding path program 1 times [2019-09-08 11:45:39,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:39,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:41,003 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 11:45:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:41,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 11:45:41,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:45:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:45:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:45:41,005 INFO L87 Difference]: Start difference. First operand 374 states and 492 transitions. Second operand 22 states. [2019-09-08 11:45:41,204 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 11:45:41,792 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 11:45:42,015 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 11:45:42,283 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 11:45:42,523 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 11:45:42,794 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-08 11:45:43,029 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:45:43,267 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:45:43,523 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 11:45:43,775 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 11:45:43,985 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:45:44,196 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:45:44,437 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:45:44,592 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-08 11:45:44,790 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-08 11:45:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:45,843 INFO L93 Difference]: Finished difference Result 616 states and 837 transitions. [2019-09-08 11:45:45,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:45:45,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-09-08 11:45:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:45,844 INFO L225 Difference]: With dead ends: 616 [2019-09-08 11:45:45,844 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 11:45:45,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:45:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 11:45:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 380. [2019-09-08 11:45:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-08 11:45:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 498 transitions. [2019-09-08 11:45:45,979 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 498 transitions. Word has length 77 [2019-09-08 11:45:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:45,980 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 498 transitions. [2019-09-08 11:45:45,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:45:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 498 transitions. [2019-09-08 11:45:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:45:45,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:45,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:45,981 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash -426565732, now seen corresponding path program 1 times [2019-09-08 11:45:45,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:45,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:45,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:46,416 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 11:45:46,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:46,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:45:46,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:45:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:45:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:45:46,419 INFO L87 Difference]: Start difference. First operand 380 states and 498 transitions. Second operand 10 states. [2019-09-08 11:45:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:48,140 INFO L93 Difference]: Finished difference Result 1270 states and 1833 transitions. [2019-09-08 11:45:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:45:48,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-08 11:45:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:48,143 INFO L225 Difference]: With dead ends: 1270 [2019-09-08 11:45:48,143 INFO L226 Difference]: Without dead ends: 1237 [2019-09-08 11:45:48,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:45:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-09-08 11:45:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 347. [2019-09-08 11:45:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 11:45:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 463 transitions. [2019-09-08 11:45:48,254 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 463 transitions. Word has length 78 [2019-09-08 11:45:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:48,255 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 463 transitions. [2019-09-08 11:45:48,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:45:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2019-09-08 11:45:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:45:48,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:48,256 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] [2019-09-08 11:45:48,256 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 123664725, now seen corresponding path program 1 times [2019-09-08 11:45:48,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:48,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:45:48,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:48,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:45:48,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:45:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:45:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:45:48,331 INFO L87 Difference]: Start difference. First operand 347 states and 463 transitions. Second operand 3 states. [2019-09-08 11:45:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:48,536 INFO L93 Difference]: Finished difference Result 747 states and 1057 transitions. [2019-09-08 11:45:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:45:48,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:45:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:48,538 INFO L225 Difference]: With dead ends: 747 [2019-09-08 11:45:48,538 INFO L226 Difference]: Without dead ends: 539 [2019-09-08 11:45:48,539 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 11:45:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-08 11:45:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2019-09-08 11:45:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-08 11:45:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 739 transitions. [2019-09-08 11:45:48,747 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 739 transitions. Word has length 100 [2019-09-08 11:45:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:48,748 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 739 transitions. [2019-09-08 11:45:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:45:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 739 transitions. [2019-09-08 11:45:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:45:48,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:48,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:48,749 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 584012325, now seen corresponding path program 1 times [2019-09-08 11:45:48,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:48,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:48,801 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 11:45:48,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:45:48,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:45:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:45:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:45:48,803 INFO L87 Difference]: Start difference. First operand 537 states and 739 transitions. Second operand 3 states. [2019-09-08 11:45:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:49,217 INFO L93 Difference]: Finished difference Result 1293 states and 1845 transitions. [2019-09-08 11:45:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:45:49,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:45:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:49,220 INFO L225 Difference]: With dead ends: 1293 [2019-09-08 11:45:49,220 INFO L226 Difference]: Without dead ends: 895 [2019-09-08 11:45:49,221 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 11:45:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-09-08 11:45:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2019-09-08 11:45:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-09-08 11:45:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1247 transitions. [2019-09-08 11:45:49,714 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1247 transitions. Word has length 102 [2019-09-08 11:45:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:49,715 INFO L475 AbstractCegarLoop]: Abstraction has 893 states and 1247 transitions. [2019-09-08 11:45:49,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:45:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1247 transitions. [2019-09-08 11:45:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:45:49,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:49,716 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] [2019-09-08 11:45:49,716 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 650505837, now seen corresponding path program 1 times [2019-09-08 11:45:49,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:49,783 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 11:45:49,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:49,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:45:49,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:45:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:45:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:45:49,785 INFO L87 Difference]: Start difference. First operand 893 states and 1247 transitions. Second operand 3 states. [2019-09-08 11:45:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:50,402 INFO L93 Difference]: Finished difference Result 2033 states and 2901 transitions. [2019-09-08 11:45:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:45:50,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:45:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:50,406 INFO L225 Difference]: With dead ends: 2033 [2019-09-08 11:45:50,406 INFO L226 Difference]: Without dead ends: 1279 [2019-09-08 11:45:50,408 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 11:45:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-09-08 11:45:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1277. [2019-09-08 11:45:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-09-08 11:45:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1795 transitions. [2019-09-08 11:45:51,072 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1795 transitions. Word has length 102 [2019-09-08 11:45:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:51,072 INFO L475 AbstractCegarLoop]: Abstraction has 1277 states and 1795 transitions. [2019-09-08 11:45:51,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:45:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1795 transitions. [2019-09-08 11:45:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:45:51,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:51,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:45:51,074 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash 184976012, now seen corresponding path program 1 times [2019-09-08 11:45:51,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:51,133 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 11:45:51,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:51,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:45:51,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:45:51,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:45:51,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:45:51,135 INFO L87 Difference]: Start difference. First operand 1277 states and 1795 transitions. Second operand 5 states. [2019-09-08 11:45:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:53,307 INFO L93 Difference]: Finished difference Result 5781 states and 8231 transitions. [2019-09-08 11:45:53,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:45:53,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:45:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:53,315 INFO L225 Difference]: With dead ends: 5781 [2019-09-08 11:45:53,315 INFO L226 Difference]: Without dead ends: 4643 [2019-09-08 11:45:53,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:45:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-09-08 11:45:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 2509. [2019-09-08 11:45:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-09-08 11:45:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3535 transitions. [2019-09-08 11:45:54,415 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3535 transitions. Word has length 102 [2019-09-08 11:45:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:54,415 INFO L475 AbstractCegarLoop]: Abstraction has 2509 states and 3535 transitions. [2019-09-08 11:45:54,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:45:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3535 transitions. [2019-09-08 11:45:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:45:54,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:54,416 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] [2019-09-08 11:45:54,417 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2060125324, now seen corresponding path program 1 times [2019-09-08 11:45:54,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:54,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:54,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:54,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:54,493 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 11:45:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:54,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:45:54,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:45:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:45:54,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:45:54,496 INFO L87 Difference]: Start difference. First operand 2509 states and 3535 transitions. Second operand 5 states. [2019-09-08 11:45:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:58,090 INFO L93 Difference]: Finished difference Result 10461 states and 14819 transitions. [2019-09-08 11:45:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:45:58,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:45:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:58,104 INFO L225 Difference]: With dead ends: 10461 [2019-09-08 11:45:58,104 INFO L226 Difference]: Without dead ends: 8091 [2019-09-08 11:45:58,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:45:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2019-09-08 11:46:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 5069. [2019-09-08 11:46:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5069 states. [2019-09-08 11:46:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 7111 transitions. [2019-09-08 11:46:00,314 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 7111 transitions. Word has length 102 [2019-09-08 11:46:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:00,314 INFO L475 AbstractCegarLoop]: Abstraction has 5069 states and 7111 transitions. [2019-09-08 11:46:00,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:46:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 7111 transitions. [2019-09-08 11:46:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:46:00,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:00,317 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] [2019-09-08 11:46:00,317 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1870756212, now seen corresponding path program 1 times [2019-09-08 11:46:00,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:00,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:00,388 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 11:46:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:00,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:46:00,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:46:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:46:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:46:00,389 INFO L87 Difference]: Start difference. First operand 5069 states and 7111 transitions. Second operand 5 states. [2019-09-08 11:46:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:06,458 INFO L93 Difference]: Finished difference Result 18891 states and 26533 transitions. [2019-09-08 11:46:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:46:06,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:46:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:06,486 INFO L225 Difference]: With dead ends: 18891 [2019-09-08 11:46:06,487 INFO L226 Difference]: Without dead ends: 13961 [2019-09-08 11:46:06,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:46:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13961 states. [2019-09-08 11:46:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13961 to 8333. [2019-09-08 11:46:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8333 states. [2019-09-08 11:46:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 11567 transitions. [2019-09-08 11:46:10,218 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 11567 transitions. Word has length 102 [2019-09-08 11:46:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:10,219 INFO L475 AbstractCegarLoop]: Abstraction has 8333 states and 11567 transitions. [2019-09-08 11:46:10,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:46:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 11567 transitions. [2019-09-08 11:46:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:46:10,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:10,222 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] [2019-09-08 11:46:10,222 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1130297204, now seen corresponding path program 1 times [2019-09-08 11:46:10,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:10,275 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 11:46:10,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:10,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:46:10,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:46:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:46:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:46:10,277 INFO L87 Difference]: Start difference. First operand 8333 states and 11567 transitions. Second operand 5 states. [2019-09-08 11:46:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:18,065 INFO L93 Difference]: Finished difference Result 26117 states and 35955 transitions. [2019-09-08 11:46:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:46:18,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:46:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:18,094 INFO L225 Difference]: With dead ends: 26117 [2019-09-08 11:46:18,095 INFO L226 Difference]: Without dead ends: 17923 [2019-09-08 11:46:18,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:46:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17923 states. [2019-09-08 11:46:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17923 to 10341. [2019-09-08 11:46:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-09-08 11:46:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 14063 transitions. [2019-09-08 11:46:22,574 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 14063 transitions. Word has length 102 [2019-09-08 11:46:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:22,577 INFO L475 AbstractCegarLoop]: Abstraction has 10341 states and 14063 transitions. [2019-09-08 11:46:22,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:46:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 14063 transitions. [2019-09-08 11:46:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:46:22,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:22,580 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] [2019-09-08 11:46:22,581 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 946884168, now seen corresponding path program 1 times [2019-09-08 11:46:22,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:22,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:22,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:22,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 11:46:22,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:22,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:46:22,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:46:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:46:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:46:22,653 INFO L87 Difference]: Start difference. First operand 10341 states and 14063 transitions. Second operand 3 states. [2019-09-08 11:46:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:29,020 INFO L93 Difference]: Finished difference Result 25673 states and 34977 transitions. [2019-09-08 11:46:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:46:29,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 11:46:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:29,045 INFO L225 Difference]: With dead ends: 25673 [2019-09-08 11:46:29,045 INFO L226 Difference]: Without dead ends: 15471 [2019-09-08 11:46:29,063 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 11:46:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15471 states. [2019-09-08 11:46:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15471 to 11289. [2019-09-08 11:46:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11289 states. [2019-09-08 11:46:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11289 states to 11289 states and 15271 transitions. [2019-09-08 11:46:33,974 INFO L78 Accepts]: Start accepts. Automaton has 11289 states and 15271 transitions. Word has length 103 [2019-09-08 11:46:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:33,974 INFO L475 AbstractCegarLoop]: Abstraction has 11289 states and 15271 transitions. [2019-09-08 11:46:33,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:46:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11289 states and 15271 transitions. [2019-09-08 11:46:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:46:33,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:33,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:46:33,976 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1566165679, now seen corresponding path program 1 times [2019-09-08 11:46:33,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:33,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:33,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:33,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:33,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:34,042 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 11:46:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:46:34,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:46:34,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:46:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:46:34,043 INFO L87 Difference]: Start difference. First operand 11289 states and 15271 transitions. Second operand 3 states. [2019-09-08 11:46:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:38,622 INFO L93 Difference]: Finished difference Result 21985 states and 29721 transitions. [2019-09-08 11:46:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:46:38,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:46:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:38,633 INFO L225 Difference]: With dead ends: 21985 [2019-09-08 11:46:38,634 INFO L226 Difference]: Without dead ends: 10835 [2019-09-08 11:46:38,649 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 11:46:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10835 states. [2019-09-08 11:46:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10835 to 10833. [2019-09-08 11:46:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10833 states. [2019-09-08 11:46:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10833 states to 10833 states and 14479 transitions. [2019-09-08 11:46:43,194 INFO L78 Accepts]: Start accepts. Automaton has 10833 states and 14479 transitions. Word has length 104 [2019-09-08 11:46:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:43,195 INFO L475 AbstractCegarLoop]: Abstraction has 10833 states and 14479 transitions. [2019-09-08 11:46:43,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:46:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10833 states and 14479 transitions. [2019-09-08 11:46:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:46:43,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:43,196 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] [2019-09-08 11:46:43,196 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1336267628, now seen corresponding path program 1 times [2019-09-08 11:46:43,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:43,245 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 11:46:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:46:43,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:46:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:46:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:46:43,246 INFO L87 Difference]: Start difference. First operand 10833 states and 14479 transitions. Second operand 3 states. [2019-09-08 11:46:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:48,608 INFO L93 Difference]: Finished difference Result 22565 states and 30233 transitions. [2019-09-08 11:46:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:46:48,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:46:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:48,619 INFO L225 Difference]: With dead ends: 22565 [2019-09-08 11:46:48,619 INFO L226 Difference]: Without dead ends: 11871 [2019-09-08 11:46:48,631 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 11:46:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2019-09-08 11:46:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 11869. [2019-09-08 11:46:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-09-08 11:46:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15807 transitions. [2019-09-08 11:46:53,542 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15807 transitions. Word has length 105 [2019-09-08 11:46:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:53,542 INFO L475 AbstractCegarLoop]: Abstraction has 11869 states and 15807 transitions. [2019-09-08 11:46:53,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:46:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15807 transitions. [2019-09-08 11:46:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:46:53,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:53,543 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] [2019-09-08 11:46:53,543 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1361931859, now seen corresponding path program 1 times [2019-09-08 11:46:53,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:53,624 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 11:46:53,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:53,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:46:53,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:46:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:46:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:46:53,626 INFO L87 Difference]: Start difference. First operand 11869 states and 15807 transitions. Second operand 6 states. [2019-09-08 11:47:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:01,285 INFO L93 Difference]: Finished difference Result 17529 states and 23204 transitions. [2019-09-08 11:47:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:47:01,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-08 11:47:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:01,301 INFO L225 Difference]: With dead ends: 17529 [2019-09-08 11:47:01,301 INFO L226 Difference]: Without dead ends: 17527 [2019-09-08 11:47:01,304 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 11:47:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17527 states. [2019-09-08 11:47:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17527 to 12013. [2019-09-08 11:47:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12013 states. [2019-09-08 11:47:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12013 states to 12013 states and 15903 transitions. [2019-09-08 11:47:06,513 INFO L78 Accepts]: Start accepts. Automaton has 12013 states and 15903 transitions. Word has length 105 [2019-09-08 11:47:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:06,514 INFO L475 AbstractCegarLoop]: Abstraction has 12013 states and 15903 transitions. [2019-09-08 11:47:06,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:47:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 12013 states and 15903 transitions. [2019-09-08 11:47:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:47:06,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:06,518 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:47:06,518 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1412769504, now seen corresponding path program 1 times [2019-09-08 11:47:06,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:06,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:06,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:06,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:47:06,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:47:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:47:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:47:06,588 INFO L87 Difference]: Start difference. First operand 12013 states and 15903 transitions. Second operand 3 states. [2019-09-08 11:47:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:13,101 INFO L93 Difference]: Finished difference Result 26561 states and 35041 transitions. [2019-09-08 11:47:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:47:13,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 11:47:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:13,114 INFO L225 Difference]: With dead ends: 26561 [2019-09-08 11:47:13,114 INFO L226 Difference]: Without dead ends: 14687 [2019-09-08 11:47:13,126 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 11:47:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-09-08 11:47:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 10909. [2019-09-08 11:47:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10909 states. [2019-09-08 11:47:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10909 states to 10909 states and 14103 transitions. [2019-09-08 11:47:17,970 INFO L78 Accepts]: Start accepts. Automaton has 10909 states and 14103 transitions. Word has length 131 [2019-09-08 11:47:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:17,970 INFO L475 AbstractCegarLoop]: Abstraction has 10909 states and 14103 transitions. [2019-09-08 11:47:17,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:47:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 10909 states and 14103 transitions. [2019-09-08 11:47:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:47:17,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:17,973 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:47:17,973 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1770437427, now seen corresponding path program 1 times [2019-09-08 11:47:17,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:17,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:17,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:47:18,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:18,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:47:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:47:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:47:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:47:18,113 INFO L87 Difference]: Start difference. First operand 10909 states and 14103 transitions. Second operand 6 states. [2019-09-08 11:47:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:37,896 INFO L93 Difference]: Finished difference Result 53795 states and 69398 transitions. [2019-09-08 11:47:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:47:37,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-08 11:47:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:37,935 INFO L225 Difference]: With dead ends: 53795 [2019-09-08 11:47:37,935 INFO L226 Difference]: Without dead ends: 43025 [2019-09-08 11:47:37,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:47:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43025 states. [2019-09-08 11:47:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43025 to 17893. [2019-09-08 11:47:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17893 states. [2019-09-08 11:47:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17893 states to 17893 states and 23019 transitions. [2019-09-08 11:47:46,550 INFO L78 Accepts]: Start accepts. Automaton has 17893 states and 23019 transitions. Word has length 132 [2019-09-08 11:47:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:46,550 INFO L475 AbstractCegarLoop]: Abstraction has 17893 states and 23019 transitions. [2019-09-08 11:47:46,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:47:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 17893 states and 23019 transitions. [2019-09-08 11:47:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:47:46,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:46,554 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] [2019-09-08 11:47:46,554 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash 468797645, now seen corresponding path program 1 times [2019-09-08 11:47:46,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:46,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:46,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:46,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:46,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:47:46,677 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 11:47:46,703 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 11:47:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:46,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:47:46,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:47:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:47:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:47:47,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:47:47,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:47:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:47:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:47:47,124 INFO L87 Difference]: Start difference. First operand 17893 states and 23019 transitions. Second operand 10 states. [2019-09-08 11:48:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:33,200 INFO L93 Difference]: Finished difference Result 106693 states and 137499 transitions. [2019-09-08 11:48:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:48:33,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-08 11:48:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:33,576 INFO L225 Difference]: With dead ends: 106693 [2019-09-08 11:48:33,576 INFO L226 Difference]: Without dead ends: 95923 [2019-09-08 11:48:33,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:48:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95923 states. [2019-09-08 11:48:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95923 to 35645. [2019-09-08 11:48:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35645 states. [2019-09-08 11:48:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35645 states to 35645 states and 45887 transitions. [2019-09-08 11:48:53,204 INFO L78 Accepts]: Start accepts. Automaton has 35645 states and 45887 transitions. Word has length 132 [2019-09-08 11:48:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:53,205 INFO L475 AbstractCegarLoop]: Abstraction has 35645 states and 45887 transitions. [2019-09-08 11:48:53,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:48:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 35645 states and 45887 transitions. [2019-09-08 11:48:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:48:53,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:53,213 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:48:53,213 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1209256653, now seen corresponding path program 1 times [2019-09-08 11:48:53,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:53,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:53,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:48:53,363 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 11:48:53,390 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 11:48:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:53,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:48:53,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:48:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:48:53,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:48:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:48:53,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:48:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:48:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:48:53,807 INFO L87 Difference]: Start difference. First operand 35645 states and 45887 transitions. Second operand 10 states. [2019-09-08 11:49:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:37,292 INFO L93 Difference]: Finished difference Result 118343 states and 152692 transitions. [2019-09-08 11:49:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:49:37,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-08 11:49:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:37,441 INFO L225 Difference]: With dead ends: 118343 [2019-09-08 11:49:37,441 INFO L226 Difference]: Without dead ends: 89821 [2019-09-08 11:49:37,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:49:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89821 states. [2019-09-08 11:50:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89821 to 51709. [2019-09-08 11:50:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51709 states. [2019-09-08 11:50:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51709 states to 51709 states and 66423 transitions. [2019-09-08 11:50:04,739 INFO L78 Accepts]: Start accepts. Automaton has 51709 states and 66423 transitions. Word has length 132 [2019-09-08 11:50:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:04,740 INFO L475 AbstractCegarLoop]: Abstraction has 51709 states and 66423 transitions. [2019-09-08 11:50:04,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:50:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51709 states and 66423 transitions. [2019-09-08 11:50:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:50:04,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:04,745 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] [2019-09-08 11:50:04,745 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 458609703, now seen corresponding path program 1 times [2019-09-08 11:50:04,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:04,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 11:50:04,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:04,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:04,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:04,832 INFO L87 Difference]: Start difference. First operand 51709 states and 66423 transitions. Second operand 3 states. [2019-09-08 11:50:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:38,233 INFO L93 Difference]: Finished difference Result 114273 states and 146137 transitions. [2019-09-08 11:50:38,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:50:38,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-08 11:50:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:38,298 INFO L225 Difference]: With dead ends: 114273 [2019-09-08 11:50:38,299 INFO L226 Difference]: Without dead ends: 62703 [2019-09-08 11:50:38,338 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 11:50:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62703 states. [2019-09-08 11:51:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62703 to 59221. [2019-09-08 11:51:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59221 states. [2019-09-08 11:51:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59221 states to 59221 states and 74999 transitions. [2019-09-08 11:51:08,671 INFO L78 Accepts]: Start accepts. Automaton has 59221 states and 74999 transitions. Word has length 133 [2019-09-08 11:51:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:08,671 INFO L475 AbstractCegarLoop]: Abstraction has 59221 states and 74999 transitions. [2019-09-08 11:51:08,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59221 states and 74999 transitions. [2019-09-08 11:51:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:51:08,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:08,676 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:08,676 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash 276122260, now seen corresponding path program 1 times [2019-09-08 11:51:08,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:08,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:08,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:51:08,795 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 11:51:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:51:09,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:51:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:51:09,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:51:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:51:09,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:51:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:51:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:51:09,408 INFO L87 Difference]: Start difference. First operand 59221 states and 74999 transitions. Second operand 10 states. [2019-09-08 11:52:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:29,128 INFO L93 Difference]: Finished difference Result 206251 states and 261910 transitions. [2019-09-08 11:52:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:52:29,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-09-08 11:52:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:29,314 INFO L225 Difference]: With dead ends: 206251 [2019-09-08 11:52:29,314 INFO L226 Difference]: Without dead ends: 155169 [2019-09-08 11:52:29,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:52:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155169 states. [2019-09-08 11:53:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155169 to 82397. [2019-09-08 11:53:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82397 states. [2019-09-08 11:53:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82397 states to 82397 states and 104247 transitions. [2019-09-08 11:53:14,269 INFO L78 Accepts]: Start accepts. Automaton has 82397 states and 104247 transitions. Word has length 133 [2019-09-08 11:53:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:14,270 INFO L475 AbstractCegarLoop]: Abstraction has 82397 states and 104247 transitions. [2019-09-08 11:53:14,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:53:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 82397 states and 104247 transitions. [2019-09-08 11:53:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 11:53:14,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:14,276 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:53:14,276 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1477364032, now seen corresponding path program 1 times [2019-09-08 11:53:14,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:14,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:14,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:14,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:53:14,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:53:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:15,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 11:53:15,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:53:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:53:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:53:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:53:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:15,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:53:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-08 11:53:15,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:53:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:53:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:53:15,631 INFO L87 Difference]: Start difference. First operand 82397 states and 104247 transitions. Second operand 21 states. [2019-09-08 11:53:17,850 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 11:53:18,020 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:53:18,165 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 11:53:18,334 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 11:53:18,831 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 11:53:19,049 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:19,353 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:19,494 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 11:53:19,680 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 11:53:19,858 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 11:53:20,313 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:53:20,503 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:53:20,795 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 11:53:21,300 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:53:21,825 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 11:53:22,006 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 11:53:22,214 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 11:53:22,525 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 11:53:22,762 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 11:53:22,962 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:53:23,312 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 11:53:23,612 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 11:53:23,859 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:24,278 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 11:53:24,447 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 11:53:24,718 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:53:24,908 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:53:25,141 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:25,311 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:25,948 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 11:53:26,160 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 11:53:26,431 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 11:53:26,606 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 11:53:26,838 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 11:53:27,053 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 11:53:27,274 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:53:27,433 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:53:27,633 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:27,820 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:27,980 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:53:28,348 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 11:53:28,687 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 11:53:28,858 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 11:53:29,037 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 11:53:29,330 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:53:29,538 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:53:29,738 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:53:29,917 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 11:53:30,300 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:30,557 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 11:53:30,771 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 11:53:31,260 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-08 11:53:31,410 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 11:53:31,594 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:31,837 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 11:53:31,985 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 11:53:32,162 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:32,886 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 11:53:33,036 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:53:33,375 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:53:33,642 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 11:53:33,859 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-08 11:53:34,110 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-08 11:53:34,320 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:53:34,513 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:53:34,710 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 11:53:34,950 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-08 11:53:35,117 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 11:53:35,308 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:53:35,508 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 11:53:36,025 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:36,516 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:36,715 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 11:53:36,893 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:37,100 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 11:53:37,390 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 11:53:37,719 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 11:53:37,890 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:53:38,106 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 11:53:38,483 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-08 11:53:39,009 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 11:53:39,223 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 11:53:39,647 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:53:39,869 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:40,177 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 11:53:40,383 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 11:53:40,591 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 11:53:40,860 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 11:53:41,345 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 11:53:41,566 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:41,735 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:53:42,918 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 11:53:43,289 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-08 11:54:03,285 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 11:54:03,490 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 11:54:03,918 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 11:54:06,668 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 11:54:06,863 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 11:54:07,069 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 11:54:07,420 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 11:54:23,436 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 11:54:23,768 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 11:54:25,836 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 11:54:26,138 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 11:54:26,487 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:54:26,693 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 11:54:31,016 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:54:32,049 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 11:54:32,286 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 11:54:32,570 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 11:54:32,723 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:54:32,988 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 11:54:33,143 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:54:35,390 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:54:35,694 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 11:54:35,933 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 11:54:36,268 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 11:54:36,411 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:54:36,620 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:54:36,843 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 11:54:37,074 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 11:54:37,224 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:54:37,388 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 11:54:38,637 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 11:54:40,097 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:54:40,302 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 11:54:40,540 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 11:54:40,842 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 11:54:41,159 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 11:54:41,377 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 11:54:41,535 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 11:54:41,804 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 11:54:41,990 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 11:54:43,089 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-08 11:54:43,250 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 11:54:43,685 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 11:54:44,510 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:54:44,847 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:54:45,084 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 11:54:45,569 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:54:45,778 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 11:54:46,039 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-08 11:54:49,374 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:54:51,006 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:54:51,365 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:54:51,601 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 11:54:52,005 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 11:54:54,279 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 11:54:54,662 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:54:54,932 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 11:54:55,247 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:54:55,486 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-08 11:54:55,765 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 11:54:56,060 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 11:55:52,884 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 11:55:56,709 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46