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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:32:29,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:32:29,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:32:29,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:32:29,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:32:29,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:32:29,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:32:29,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:32:29,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:32:29,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:32:29,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:32:29,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:32:29,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:32:29,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:32:29,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:32:29,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:32:29,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:32:29,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:32:29,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:32:29,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:32:29,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:32:29,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:32:29,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:32:29,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:32:29,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:32:29,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:32:29,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:32:29,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:32:29,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:32:29,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:32:29,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:32:29,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:32:29,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:32:29,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:32:29,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:32:29,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:32:29,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:32:29,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:32:29,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:32:29,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:32:29,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:32:29,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:32:30,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:32:30,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:32:30,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:32:30,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:32:30,019 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:32:30,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:32:30,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:32:30,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:32:30,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:32:30,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:32:30,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:32:30,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:32:30,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:32:30,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:32:30,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:32:30,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:32:30,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:32:30,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:32:30,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:32:30,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:32:30,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:32:30,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:32:30,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:32:30,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:32:30,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:32:30,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:32:30,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:32:30,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:32:30,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:32:30,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:32:30,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:32:30,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:32:30,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:32:30,105 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:32:30,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:32:30,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba54ec7/456448b4f55746f9bd1fa94181248907/FLAGb0a9b9b49 [2019-09-08 12:32:30,972 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:32:30,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:32:31,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba54ec7/456448b4f55746f9bd1fa94181248907/FLAGb0a9b9b49 [2019-09-08 12:32:31,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba54ec7/456448b4f55746f9bd1fa94181248907 [2019-09-08 12:32:31,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:32:31,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:32:31,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:31,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:32:31,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:32:31,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:31" (1/1) ... [2019-09-08 12:32:31,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f93532c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:31, skipping insertion in model container [2019-09-08 12:32:31,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:31" (1/1) ... [2019-09-08 12:32:31,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:32:31,806 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:32:34,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:34,212 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:32:35,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:35,451 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:32:35,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35 WrapperNode [2019-09-08 12:32:35,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:35,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:32:35,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:32:35,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:32:35,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... [2019-09-08 12:32:35,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:32:35,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:32:35,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:32:35,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:32:35,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:32:35,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:32:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:32:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:32:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:32:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:32:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:32:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:32:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:32:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:32:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:32:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:32:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:32:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:32:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:32:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:32:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:32:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:32:41,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:32:41,785 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:32:41,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:41 BoogieIcfgContainer [2019-09-08 12:32:41,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:32:41,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:32:41,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:32:41,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:32:41,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:32:31" (1/3) ... [2019-09-08 12:32:41,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6028211f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:41, skipping insertion in model container [2019-09-08 12:32:41,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:35" (2/3) ... [2019-09-08 12:32:41,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6028211f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:41, skipping insertion in model container [2019-09-08 12:32:41,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:41" (3/3) ... [2019-09-08 12:32:41,805 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:32:41,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:32:41,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-08 12:32:41,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-08 12:32:41,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:32:41,910 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:32:41,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:32:41,910 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:32:41,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:32:41,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:32:41,910 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:32:41,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:32:41,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:32:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states. [2019-09-08 12:32:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:32:41,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:41,999 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 12:32:42,002 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash 215023617, now seen corresponding path program 1 times [2019-09-08 12:32:42,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:42,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:42,855 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand 5 states. [2019-09-08 12:32:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:45,520 INFO L93 Difference]: Finished difference Result 3689 states and 6466 transitions. [2019-09-08 12:32:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:45,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:32:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:45,552 INFO L225 Difference]: With dead ends: 3689 [2019-09-08 12:32:45,552 INFO L226 Difference]: Without dead ends: 2160 [2019-09-08 12:32:45,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-09-08 12:32:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2058. [2019-09-08 12:32:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-08 12:32:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2776 transitions. [2019-09-08 12:32:45,730 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2776 transitions. Word has length 105 [2019-09-08 12:32:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:45,731 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2776 transitions. [2019-09-08 12:32:45,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2776 transitions. [2019-09-08 12:32:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:32:45,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:45,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:45,741 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -650934382, now seen corresponding path program 1 times [2019-09-08 12:32:45,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:45,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:46,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:46,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:46,033 INFO L87 Difference]: Start difference. First operand 2058 states and 2776 transitions. Second operand 5 states. [2019-09-08 12:32:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:47,163 INFO L93 Difference]: Finished difference Result 3546 states and 4919 transitions. [2019-09-08 12:32:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:47,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:32:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:47,174 INFO L225 Difference]: With dead ends: 3546 [2019-09-08 12:32:47,174 INFO L226 Difference]: Without dead ends: 1805 [2019-09-08 12:32:47,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-08 12:32:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2019-09-08 12:32:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2019-09-08 12:32:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2489 transitions. [2019-09-08 12:32:47,256 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2489 transitions. Word has length 106 [2019-09-08 12:32:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:47,257 INFO L475 AbstractCegarLoop]: Abstraction has 1805 states and 2489 transitions. [2019-09-08 12:32:47,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2489 transitions. [2019-09-08 12:32:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:47,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:47,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:47,265 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 813965667, now seen corresponding path program 1 times [2019-09-08 12:32:47,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:47,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:47,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:47,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:47,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:47,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:47,633 INFO L87 Difference]: Start difference. First operand 1805 states and 2489 transitions. Second operand 5 states. [2019-09-08 12:32:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:49,161 INFO L93 Difference]: Finished difference Result 3293 states and 4630 transitions. [2019-09-08 12:32:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:49,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 12:32:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:49,176 INFO L225 Difference]: With dead ends: 3293 [2019-09-08 12:32:49,176 INFO L226 Difference]: Without dead ends: 1725 [2019-09-08 12:32:49,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-09-08 12:32:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1725. [2019-09-08 12:32:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-09-08 12:32:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2391 transitions. [2019-09-08 12:32:49,274 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2391 transitions. Word has length 107 [2019-09-08 12:32:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:49,276 INFO L475 AbstractCegarLoop]: Abstraction has 1725 states and 2391 transitions. [2019-09-08 12:32:49,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2391 transitions. [2019-09-08 12:32:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:49,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:49,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:49,283 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1237924957, now seen corresponding path program 1 times [2019-09-08 12:32:49,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:49,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:49,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:49,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:49,520 INFO L87 Difference]: Start difference. First operand 1725 states and 2391 transitions. Second operand 5 states. [2019-09-08 12:32:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:50,583 INFO L93 Difference]: Finished difference Result 3213 states and 4530 transitions. [2019-09-08 12:32:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:50,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-08 12:32:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:50,594 INFO L225 Difference]: With dead ends: 3213 [2019-09-08 12:32:50,595 INFO L226 Difference]: Without dead ends: 1643 [2019-09-08 12:32:50,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-09-08 12:32:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2019-09-08 12:32:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-09-08 12:32:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2299 transitions. [2019-09-08 12:32:50,682 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2299 transitions. Word has length 108 [2019-09-08 12:32:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:50,683 INFO L475 AbstractCegarLoop]: Abstraction has 1643 states and 2299 transitions. [2019-09-08 12:32:50,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2299 transitions. [2019-09-08 12:32:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:32:50,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:50,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:50,689 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 525572155, now seen corresponding path program 1 times [2019-09-08 12:32:50,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:50,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:50,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:50,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:50,988 INFO L87 Difference]: Start difference. First operand 1643 states and 2299 transitions. Second operand 5 states. [2019-09-08 12:32:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:52,067 INFO L93 Difference]: Finished difference Result 3131 states and 4436 transitions. [2019-09-08 12:32:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:52,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 12:32:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:52,077 INFO L225 Difference]: With dead ends: 3131 [2019-09-08 12:32:52,077 INFO L226 Difference]: Without dead ends: 1605 [2019-09-08 12:32:52,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-09-08 12:32:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2019-09-08 12:32:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-08 12:32:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2255 transitions. [2019-09-08 12:32:52,175 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2255 transitions. Word has length 109 [2019-09-08 12:32:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:52,177 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2255 transitions. [2019-09-08 12:32:52,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2255 transitions. [2019-09-08 12:32:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:32:52,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:52,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:52,185 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1784526045, now seen corresponding path program 1 times [2019-09-08 12:32:52,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:52,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:52,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:52,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:52,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:52,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:52,400 INFO L87 Difference]: Start difference. First operand 1605 states and 2255 transitions. Second operand 5 states. [2019-09-08 12:32:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:53,531 INFO L93 Difference]: Finished difference Result 3093 states and 4390 transitions. [2019-09-08 12:32:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:53,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 12:32:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:53,542 INFO L225 Difference]: With dead ends: 3093 [2019-09-08 12:32:53,542 INFO L226 Difference]: Without dead ends: 1580 [2019-09-08 12:32:53,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-09-08 12:32:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-09-08 12:32:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-09-08 12:32:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2226 transitions. [2019-09-08 12:32:53,652 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2226 transitions. Word has length 110 [2019-09-08 12:32:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:53,654 INFO L475 AbstractCegarLoop]: Abstraction has 1580 states and 2226 transitions. [2019-09-08 12:32:53,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2226 transitions. [2019-09-08 12:32:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:32:53,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:53,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:53,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1947358668, now seen corresponding path program 1 times [2019-09-08 12:32:53,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:53,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:53,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:53,886 INFO L87 Difference]: Start difference. First operand 1580 states and 2226 transitions. Second operand 5 states. [2019-09-08 12:32:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:55,006 INFO L93 Difference]: Finished difference Result 3068 states and 4359 transitions. [2019-09-08 12:32:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:55,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-08 12:32:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:55,016 INFO L225 Difference]: With dead ends: 3068 [2019-09-08 12:32:55,016 INFO L226 Difference]: Without dead ends: 1572 [2019-09-08 12:32:55,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-09-08 12:32:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2019-09-08 12:32:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:32:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2215 transitions. [2019-09-08 12:32:55,094 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2215 transitions. Word has length 111 [2019-09-08 12:32:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:55,094 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2215 transitions. [2019-09-08 12:32:55,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2215 transitions. [2019-09-08 12:32:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:32:55,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:55,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:55,100 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash 386796312, now seen corresponding path program 1 times [2019-09-08 12:32:55,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:55,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:55,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:55,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:32:55,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:32:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:32:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:32:55,463 INFO L87 Difference]: Start difference. First operand 1572 states and 2215 transitions. Second operand 8 states. [2019-09-08 12:32:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:57,556 INFO L93 Difference]: Finished difference Result 2724 states and 3704 transitions. [2019-09-08 12:32:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:32:57,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-08 12:32:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:57,573 INFO L225 Difference]: With dead ends: 2724 [2019-09-08 12:32:57,573 INFO L226 Difference]: Without dead ends: 2055 [2019-09-08 12:32:57,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:32:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-08 12:32:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1572. [2019-09-08 12:32:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:32:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2214 transitions. [2019-09-08 12:32:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2214 transitions. Word has length 112 [2019-09-08 12:32:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:57,685 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2214 transitions. [2019-09-08 12:32:57,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:32:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2214 transitions. [2019-09-08 12:32:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:32:57,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:57,691 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:57,697 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash -47028881, now seen corresponding path program 1 times [2019-09-08 12:32:57,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:58,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:58,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:58,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:58,021 INFO L87 Difference]: Start difference. First operand 1572 states and 2214 transitions. Second operand 9 states. [2019-09-08 12:33:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:00,993 INFO L93 Difference]: Finished difference Result 2401 states and 3421 transitions. [2019-09-08 12:33:00,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:33:00,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:33:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,009 INFO L225 Difference]: With dead ends: 2401 [2019-09-08 12:33:01,010 INFO L226 Difference]: Without dead ends: 2009 [2019-09-08 12:33:01,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:33:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-08 12:33:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1572. [2019-09-08 12:33:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2213 transitions. [2019-09-08 12:33:01,114 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2213 transitions. Word has length 112 [2019-09-08 12:33:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:01,114 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2213 transitions. [2019-09-08 12:33:01,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2213 transitions. [2019-09-08 12:33:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:33:01,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:01,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:01,120 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1133415737, now seen corresponding path program 1 times [2019-09-08 12:33:01,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:01,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:01,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:01,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:01,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:01,464 INFO L87 Difference]: Start difference. First operand 1572 states and 2213 transitions. Second operand 9 states. [2019-09-08 12:33:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:04,721 INFO L93 Difference]: Finished difference Result 3069 states and 4365 transitions. [2019-09-08 12:33:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:04,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:33:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:04,736 INFO L225 Difference]: With dead ends: 3069 [2019-09-08 12:33:04,737 INFO L226 Difference]: Without dead ends: 2801 [2019-09-08 12:33:04,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-08 12:33:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-08 12:33:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2212 transitions. [2019-09-08 12:33:04,853 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2212 transitions. Word has length 112 [2019-09-08 12:33:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:04,853 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2212 transitions. [2019-09-08 12:33:04,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2212 transitions. [2019-09-08 12:33:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:04,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:04,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:04,858 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1339963100, now seen corresponding path program 1 times [2019-09-08 12:33:04,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:04,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:04,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:05,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:05,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:05,132 INFO L87 Difference]: Start difference. First operand 1572 states and 2212 transitions. Second operand 9 states. [2019-09-08 12:33:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:07,935 INFO L93 Difference]: Finished difference Result 2665 states and 3782 transitions. [2019-09-08 12:33:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:33:07,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:07,946 INFO L225 Difference]: With dead ends: 2665 [2019-09-08 12:33:07,946 INFO L226 Difference]: Without dead ends: 2009 [2019-09-08 12:33:07,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:33:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-08 12:33:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1572. [2019-09-08 12:33:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2210 transitions. [2019-09-08 12:33:08,084 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2210 transitions. Word has length 114 [2019-09-08 12:33:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:08,085 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2210 transitions. [2019-09-08 12:33:08,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2210 transitions. [2019-09-08 12:33:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:08,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:08,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:08,091 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1679335211, now seen corresponding path program 1 times [2019-09-08 12:33:08,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:08,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:08,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:08,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:08,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:08,437 INFO L87 Difference]: Start difference. First operand 1572 states and 2210 transitions. Second operand 9 states. [2019-09-08 12:33:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:11,812 INFO L93 Difference]: Finished difference Result 3033 states and 4302 transitions. [2019-09-08 12:33:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:11,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:11,825 INFO L225 Difference]: With dead ends: 3033 [2019-09-08 12:33:11,826 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:33:11,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:33:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:33:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2208 transitions. [2019-09-08 12:33:11,949 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2208 transitions. Word has length 114 [2019-09-08 12:33:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:11,949 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2208 transitions. [2019-09-08 12:33:11,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2208 transitions. [2019-09-08 12:33:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:11,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:11,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:11,954 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1092834862, now seen corresponding path program 1 times [2019-09-08 12:33:11,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:11,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:11,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:12,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:12,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:12,206 INFO L87 Difference]: Start difference. First operand 1572 states and 2208 transitions. Second operand 9 states. [2019-09-08 12:33:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:15,857 INFO L93 Difference]: Finished difference Result 3173 states and 4502 transitions. [2019-09-08 12:33:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:15,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:15,870 INFO L225 Difference]: With dead ends: 3173 [2019-09-08 12:33:15,870 INFO L226 Difference]: Without dead ends: 2801 [2019-09-08 12:33:15,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-08 12:33:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-08 12:33:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2206 transitions. [2019-09-08 12:33:15,995 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2206 transitions. Word has length 114 [2019-09-08 12:33:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:15,995 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2206 transitions. [2019-09-08 12:33:15,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2206 transitions. [2019-09-08 12:33:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:15,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:15,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:15,999 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash -739954808, now seen corresponding path program 1 times [2019-09-08 12:33:16,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:16,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:16,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:16,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:16,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:16,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:16,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:16,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:16,251 INFO L87 Difference]: Start difference. First operand 1572 states and 2206 transitions. Second operand 9 states. [2019-09-08 12:33:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:19,476 INFO L93 Difference]: Finished difference Result 2784 states and 3884 transitions. [2019-09-08 12:33:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:19,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:19,484 INFO L225 Difference]: With dead ends: 2784 [2019-09-08 12:33:19,484 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:33:19,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:33:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:33:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:33:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2205 transitions. [2019-09-08 12:33:19,627 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2205 transitions. Word has length 114 [2019-09-08 12:33:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:19,628 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2205 transitions. [2019-09-08 12:33:19,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2205 transitions. [2019-09-08 12:33:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:19,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:19,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:19,632 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1250335121, now seen corresponding path program 1 times [2019-09-08 12:33:19,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:19,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:19,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:19,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:19,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:19,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:19,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:19,865 INFO L87 Difference]: Start difference. First operand 1572 states and 2205 transitions. Second operand 9 states. [2019-09-08 12:33:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:23,953 INFO L93 Difference]: Finished difference Result 3090 states and 4376 transitions. [2019-09-08 12:33:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:23,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:23,961 INFO L225 Difference]: With dead ends: 3090 [2019-09-08 12:33:23,961 INFO L226 Difference]: Without dead ends: 2801 [2019-09-08 12:33:23,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-08 12:33:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-08 12:33:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2204 transitions. [2019-09-08 12:33:24,105 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2204 transitions. Word has length 114 [2019-09-08 12:33:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:24,105 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2204 transitions. [2019-09-08 12:33:24,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2204 transitions. [2019-09-08 12:33:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:24,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:24,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:24,109 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1364856601, now seen corresponding path program 1 times [2019-09-08 12:33:24,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:24,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:24,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:24,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:24,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:24,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:24,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:24,364 INFO L87 Difference]: Start difference. First operand 1572 states and 2204 transitions. Second operand 9 states. [2019-09-08 12:33:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:28,342 INFO L93 Difference]: Finished difference Result 2989 states and 4231 transitions. [2019-09-08 12:33:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:28,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:28,349 INFO L225 Difference]: With dead ends: 2989 [2019-09-08 12:33:28,349 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:33:28,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:33:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:33:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2203 transitions. [2019-09-08 12:33:28,519 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2203 transitions. Word has length 114 [2019-09-08 12:33:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:28,520 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2203 transitions. [2019-09-08 12:33:28,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2203 transitions. [2019-09-08 12:33:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:28,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:28,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:28,524 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -855035479, now seen corresponding path program 1 times [2019-09-08 12:33:28,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:28,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:28,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:28,780 INFO L87 Difference]: Start difference. First operand 1572 states and 2203 transitions. Second operand 9 states. [2019-09-08 12:33:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:31,991 INFO L93 Difference]: Finished difference Result 2614 states and 3627 transitions. [2019-09-08 12:33:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:31,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:31,998 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:33:31,999 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:33:32,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:33:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:33:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:33:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2202 transitions. [2019-09-08 12:33:32,161 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2202 transitions. Word has length 114 [2019-09-08 12:33:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:32,162 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2202 transitions. [2019-09-08 12:33:32,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2202 transitions. [2019-09-08 12:33:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:33:32,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:32,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:32,166 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash -327442449, now seen corresponding path program 1 times [2019-09-08 12:33:32,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:32,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:32,429 INFO L87 Difference]: Start difference. First operand 1572 states and 2202 transitions. Second operand 9 states. [2019-09-08 12:33:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:36,352 INFO L93 Difference]: Finished difference Result 2982 states and 4221 transitions. [2019-09-08 12:33:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:36,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:33:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:36,357 INFO L225 Difference]: With dead ends: 2982 [2019-09-08 12:33:36,358 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:33:36,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:33:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:33:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2201 transitions. [2019-09-08 12:33:36,528 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2201 transitions. Word has length 114 [2019-09-08 12:33:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:36,528 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2201 transitions. [2019-09-08 12:33:36,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2201 transitions. [2019-09-08 12:33:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:36,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:36,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:36,532 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -577271375, now seen corresponding path program 1 times [2019-09-08 12:33:36,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:36,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:36,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:36,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:36,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:36,814 INFO L87 Difference]: Start difference. First operand 1572 states and 2201 transitions. Second operand 9 states. [2019-09-08 12:33:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:40,045 INFO L93 Difference]: Finished difference Result 2963 states and 4182 transitions. [2019-09-08 12:33:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:40,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:33:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:40,052 INFO L225 Difference]: With dead ends: 2963 [2019-09-08 12:33:40,052 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:33:40,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:33:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:33:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2199 transitions. [2019-09-08 12:33:40,208 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2199 transitions. Word has length 116 [2019-09-08 12:33:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:40,208 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2199 transitions. [2019-09-08 12:33:40,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2199 transitions. [2019-09-08 12:33:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:40,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:40,211 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:40,212 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1087651688, now seen corresponding path program 1 times [2019-09-08 12:33:40,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:40,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:40,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:40,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:40,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:40,426 INFO L87 Difference]: Start difference. First operand 1572 states and 2199 transitions. Second operand 9 states. [2019-09-08 12:33:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:44,083 INFO L93 Difference]: Finished difference Result 3053 states and 4312 transitions. [2019-09-08 12:33:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:44,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:33:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:44,087 INFO L225 Difference]: With dead ends: 3053 [2019-09-08 12:33:44,088 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:33:44,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:33:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:33:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2197 transitions. [2019-09-08 12:33:44,260 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2197 transitions. Word has length 116 [2019-09-08 12:33:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:44,261 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2197 transitions. [2019-09-08 12:33:44,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2197 transitions. [2019-09-08 12:33:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:44,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:44,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:44,265 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash -831066789, now seen corresponding path program 1 times [2019-09-08 12:33:44,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:44,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:44,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:44,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:44,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:44,517 INFO L87 Difference]: Start difference. First operand 1572 states and 2197 transitions. Second operand 9 states. [2019-09-08 12:33:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:48,164 INFO L93 Difference]: Finished difference Result 3225 states and 4546 transitions. [2019-09-08 12:33:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:48,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:33:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:48,167 INFO L225 Difference]: With dead ends: 3225 [2019-09-08 12:33:48,167 INFO L226 Difference]: Without dead ends: 2801 [2019-09-08 12:33:48,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-08 12:33:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-08 12:33:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2195 transitions. [2019-09-08 12:33:48,365 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2195 transitions. Word has length 116 [2019-09-08 12:33:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:48,365 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2195 transitions. [2019-09-08 12:33:48,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2195 transitions. [2019-09-08 12:33:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:48,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:48,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:48,369 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 755251996, now seen corresponding path program 1 times [2019-09-08 12:33:48,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:48,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:48,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 12:33:48,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:48,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:48,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:48,710 INFO L87 Difference]: Start difference. First operand 1572 states and 2195 transitions. Second operand 9 states. [2019-09-08 12:33:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:52,047 INFO L93 Difference]: Finished difference Result 2614 states and 3618 transitions. [2019-09-08 12:33:52,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:52,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:33:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:52,052 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:33:52,052 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:33:52,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:33:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:33:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:33:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2193 transitions. [2019-09-08 12:33:52,255 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2193 transitions. Word has length 116 [2019-09-08 12:33:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:52,255 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2193 transitions. [2019-09-08 12:33:52,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2193 transitions. [2019-09-08 12:33:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:52,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:52,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:52,258 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1390122634, now seen corresponding path program 1 times [2019-09-08 12:33:52,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:52,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:52,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:52,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:52,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:52,506 INFO L87 Difference]: Start difference. First operand 1572 states and 2193 transitions. Second operand 9 states. [2019-09-08 12:33:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:56,384 INFO L93 Difference]: Finished difference Result 2955 states and 4163 transitions. [2019-09-08 12:33:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:56,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:33:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:56,388 INFO L225 Difference]: With dead ends: 2955 [2019-09-08 12:33:56,388 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:33:56,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:33:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:33:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:33:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2191 transitions. [2019-09-08 12:33:56,559 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2191 transitions. Word has length 116 [2019-09-08 12:33:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:56,559 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2191 transitions. [2019-09-08 12:33:56,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2191 transitions. [2019-09-08 12:33:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:33:56,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:56,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:56,563 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2105565842, now seen corresponding path program 1 times [2019-09-08 12:33:56,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:56,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:56,830 INFO L87 Difference]: Start difference. First operand 1572 states and 2191 transitions. Second operand 9 states. [2019-09-08 12:34:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:00,667 INFO L93 Difference]: Finished difference Result 3037 states and 4279 transitions. [2019-09-08 12:34:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:00,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:00,671 INFO L225 Difference]: With dead ends: 3037 [2019-09-08 12:34:00,671 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:34:00,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:34:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:34:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2189 transitions. [2019-09-08 12:34:00,802 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2189 transitions. Word has length 116 [2019-09-08 12:34:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:00,802 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2189 transitions. [2019-09-08 12:34:00,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2189 transitions. [2019-09-08 12:34:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:00,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:00,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:00,806 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 708861456, now seen corresponding path program 1 times [2019-09-08 12:34:00,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:00,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:01,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:01,120 INFO L87 Difference]: Start difference. First operand 1572 states and 2189 transitions. Second operand 9 states. [2019-09-08 12:34:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:04,432 INFO L93 Difference]: Finished difference Result 2614 states and 3610 transitions. [2019-09-08 12:34:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:04,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:04,435 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:34:04,435 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:34:04,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:34:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:34:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:34:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2187 transitions. [2019-09-08 12:34:04,555 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2187 transitions. Word has length 116 [2019-09-08 12:34:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:04,556 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2187 transitions. [2019-09-08 12:34:04,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2187 transitions. [2019-09-08 12:34:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:04,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:04,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:04,558 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:04,558 INFO L82 PathProgramCache]: Analyzing trace with hash 629608632, now seen corresponding path program 1 times [2019-09-08 12:34:04,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:04,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:04,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:04,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:04,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:04,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:04,783 INFO L87 Difference]: Start difference. First operand 1572 states and 2187 transitions. Second operand 9 states. [2019-09-08 12:34:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:08,841 INFO L93 Difference]: Finished difference Result 3003 states and 4222 transitions. [2019-09-08 12:34:08,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:08,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:08,844 INFO L225 Difference]: With dead ends: 3003 [2019-09-08 12:34:08,844 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:34:08,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:34:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:34:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2186 transitions. [2019-09-08 12:34:08,970 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2186 transitions. Word has length 116 [2019-09-08 12:34:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:08,970 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2186 transitions. [2019-09-08 12:34:08,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2186 transitions. [2019-09-08 12:34:08,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:08,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:08,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:08,973 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:08,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1794515206, now seen corresponding path program 1 times [2019-09-08 12:34:08,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:08,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:09,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:09,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:09,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:09,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:09,180 INFO L87 Difference]: Start difference. First operand 1572 states and 2186 transitions. Second operand 9 states. [2019-09-08 12:34:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:13,360 INFO L93 Difference]: Finished difference Result 2935 states and 4127 transitions. [2019-09-08 12:34:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:13,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:13,364 INFO L225 Difference]: With dead ends: 2935 [2019-09-08 12:34:13,364 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:13,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2185 transitions. [2019-09-08 12:34:13,492 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2185 transitions. Word has length 116 [2019-09-08 12:34:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:13,492 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2185 transitions. [2019-09-08 12:34:13,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2185 transitions. [2019-09-08 12:34:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:13,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:13,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:13,495 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:13,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1410611137, now seen corresponding path program 1 times [2019-09-08 12:34:13,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:13,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:13,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:13,709 INFO L87 Difference]: Start difference. First operand 1572 states and 2185 transitions. Second operand 9 states. [2019-09-08 12:34:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:17,647 INFO L93 Difference]: Finished difference Result 2940 states and 4131 transitions. [2019-09-08 12:34:17,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:17,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:17,651 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 12:34:17,651 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:17,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2184 transitions. [2019-09-08 12:34:17,782 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2184 transitions. Word has length 116 [2019-09-08 12:34:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:17,783 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2184 transitions. [2019-09-08 12:34:17,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2184 transitions. [2019-09-08 12:34:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:17,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:17,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:17,785 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -996349276, now seen corresponding path program 1 times [2019-09-08 12:34:17,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:18,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:18,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:18,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:18,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:18,009 INFO L87 Difference]: Start difference. First operand 1572 states and 2184 transitions. Second operand 9 states. [2019-09-08 12:34:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:22,165 INFO L93 Difference]: Finished difference Result 2989 states and 4203 transitions. [2019-09-08 12:34:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:22,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:22,170 INFO L225 Difference]: With dead ends: 2989 [2019-09-08 12:34:22,170 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:34:22,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:34:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:34:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2183 transitions. [2019-09-08 12:34:22,322 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2183 transitions. Word has length 116 [2019-09-08 12:34:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:22,322 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2183 transitions. [2019-09-08 12:34:22,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2183 transitions. [2019-09-08 12:34:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:22,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:22,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:22,324 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1027968626, now seen corresponding path program 1 times [2019-09-08 12:34:22,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:22,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:22,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:22,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:22,570 INFO L87 Difference]: Start difference. First operand 1572 states and 2183 transitions. Second operand 9 states. [2019-09-08 12:34:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:26,600 INFO L93 Difference]: Finished difference Result 2935 states and 4123 transitions. [2019-09-08 12:34:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:26,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:26,604 INFO L225 Difference]: With dead ends: 2935 [2019-09-08 12:34:26,604 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:26,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2182 transitions. [2019-09-08 12:34:26,739 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2182 transitions. Word has length 116 [2019-09-08 12:34:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:26,739 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2182 transitions. [2019-09-08 12:34:26,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2182 transitions. [2019-09-08 12:34:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:26,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:26,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:26,742 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -926819479, now seen corresponding path program 1 times [2019-09-08 12:34:26,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:26,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:26,965 INFO L87 Difference]: Start difference. First operand 1572 states and 2182 transitions. Second operand 9 states. [2019-09-08 12:34:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:31,151 INFO L93 Difference]: Finished difference Result 2933 states and 4120 transitions. [2019-09-08 12:34:31,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:31,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:31,154 INFO L225 Difference]: With dead ends: 2933 [2019-09-08 12:34:31,154 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:31,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2181 transitions. [2019-09-08 12:34:31,309 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2181 transitions. Word has length 116 [2019-09-08 12:34:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:31,310 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2181 transitions. [2019-09-08 12:34:31,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2181 transitions. [2019-09-08 12:34:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:34:31,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:31,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:31,312 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash 579223384, now seen corresponding path program 1 times [2019-09-08 12:34:31,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:31,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:31,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:31,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:31,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:31,532 INFO L87 Difference]: Start difference. First operand 1572 states and 2181 transitions. Second operand 9 states. [2019-09-08 12:34:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:34,917 INFO L93 Difference]: Finished difference Result 2781 states and 3850 transitions. [2019-09-08 12:34:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:34,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:34:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:34,921 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:34:34,921 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:34:34,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:34:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:34:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:34:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2180 transitions. [2019-09-08 12:34:35,067 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2180 transitions. Word has length 116 [2019-09-08 12:34:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:35,067 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2180 transitions. [2019-09-08 12:34:35,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2180 transitions. [2019-09-08 12:34:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:35,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:35,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:35,069 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1137739447, now seen corresponding path program 1 times [2019-09-08 12:34:35,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:35,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:35,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:35,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 12:34:35,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:35,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:35,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:35,276 INFO L87 Difference]: Start difference. First operand 1572 states and 2180 transitions. Second operand 9 states. [2019-09-08 12:34:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:39,079 INFO L93 Difference]: Finished difference Result 2889 states and 4033 transitions. [2019-09-08 12:34:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:39,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:39,082 INFO L225 Difference]: With dead ends: 2889 [2019-09-08 12:34:39,082 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:34:39,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:34:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:34:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2178 transitions. [2019-09-08 12:34:39,247 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2178 transitions. Word has length 118 [2019-09-08 12:34:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:39,247 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2178 transitions. [2019-09-08 12:34:39,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2178 transitions. [2019-09-08 12:34:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:39,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:39,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:39,250 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1008288702, now seen corresponding path program 1 times [2019-09-08 12:34:39,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:39,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:39,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:39,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:39,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:39,451 INFO L87 Difference]: Start difference. First operand 1572 states and 2178 transitions. Second operand 9 states. [2019-09-08 12:34:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:43,682 INFO L93 Difference]: Finished difference Result 2971 states and 4161 transitions. [2019-09-08 12:34:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:43,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:43,684 INFO L225 Difference]: With dead ends: 2971 [2019-09-08 12:34:43,685 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:43,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2176 transitions. [2019-09-08 12:34:43,835 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2176 transitions. Word has length 118 [2019-09-08 12:34:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:43,836 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2176 transitions. [2019-09-08 12:34:43,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2176 transitions. [2019-09-08 12:34:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:43,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:43,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:43,838 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:43,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1568062438, now seen corresponding path program 1 times [2019-09-08 12:34:43,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:43,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:44,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:44,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:44,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:44,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:44,040 INFO L87 Difference]: Start difference. First operand 1572 states and 2176 transitions. Second operand 9 states. [2019-09-08 12:34:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:47,901 INFO L93 Difference]: Finished difference Result 2883 states and 4022 transitions. [2019-09-08 12:34:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:47,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:47,905 INFO L225 Difference]: With dead ends: 2883 [2019-09-08 12:34:47,905 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:34:47,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:34:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:34:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2174 transitions. [2019-09-08 12:34:48,133 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2174 transitions. Word has length 118 [2019-09-08 12:34:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2174 transitions. [2019-09-08 12:34:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2174 transitions. [2019-09-08 12:34:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:48,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:48,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:48,136 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash -530863933, now seen corresponding path program 1 times [2019-09-08 12:34:48,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:48,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:48,324 INFO L87 Difference]: Start difference. First operand 1572 states and 2174 transitions. Second operand 9 states. [2019-09-08 12:34:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:51,598 INFO L93 Difference]: Finished difference Result 2787 states and 3849 transitions. [2019-09-08 12:34:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:51,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:51,602 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:34:51,602 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:34:51,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:34:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:34:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:34:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2172 transitions. [2019-09-08 12:34:51,772 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2172 transitions. Word has length 118 [2019-09-08 12:34:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:51,772 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2172 transitions. [2019-09-08 12:34:51,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2172 transitions. [2019-09-08 12:34:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:51,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:51,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:51,775 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1463192374, now seen corresponding path program 1 times [2019-09-08 12:34:51,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:51,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:51,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:51,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:51,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:51,977 INFO L87 Difference]: Start difference. First operand 1572 states and 2172 transitions. Second operand 9 states. [2019-09-08 12:34:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:55,975 INFO L93 Difference]: Finished difference Result 2971 states and 4153 transitions. [2019-09-08 12:34:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:55,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:55,979 INFO L225 Difference]: With dead ends: 2971 [2019-09-08 12:34:55,979 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:34:55,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:34:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:34:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:34:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2170 transitions. [2019-09-08 12:34:56,180 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2170 transitions. Word has length 118 [2019-09-08 12:34:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:56,180 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2170 transitions. [2019-09-08 12:34:56,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2170 transitions. [2019-09-08 12:34:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:34:56,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:56,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:56,184 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1333741629, now seen corresponding path program 1 times [2019-09-08 12:34:56,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:56,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:56,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:56,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:56,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:56,383 INFO L87 Difference]: Start difference. First operand 1572 states and 2170 transitions. Second operand 9 states. [2019-09-08 12:34:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:59,844 INFO L93 Difference]: Finished difference Result 2787 states and 3843 transitions. [2019-09-08 12:34:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:59,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:34:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:59,847 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:34:59,847 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:34:59,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:34:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:35:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:35:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2168 transitions. [2019-09-08 12:35:00,026 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2168 transitions. Word has length 118 [2019-09-08 12:35:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:00,027 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2168 transitions. [2019-09-08 12:35:00,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2168 transitions. [2019-09-08 12:35:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:00,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:00,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:00,030 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash -872434601, now seen corresponding path program 1 times [2019-09-08 12:35:00,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:00,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:00,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:00,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:00,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:00,194 INFO L87 Difference]: Start difference. First operand 1572 states and 2168 transitions. Second operand 9 states. [2019-09-08 12:35:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:04,548 INFO L93 Difference]: Finished difference Result 3069 states and 4284 transitions. [2019-09-08 12:35:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:04,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:04,551 INFO L225 Difference]: With dead ends: 3069 [2019-09-08 12:35:04,551 INFO L226 Difference]: Without dead ends: 2769 [2019-09-08 12:35:04,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-08 12:35:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-08 12:35:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2166 transitions. [2019-09-08 12:35:04,723 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2166 transitions. Word has length 118 [2019-09-08 12:35:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:04,723 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2166 transitions. [2019-09-08 12:35:04,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2166 transitions. [2019-09-08 12:35:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:04,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:04,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:04,726 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash 302871591, now seen corresponding path program 1 times [2019-09-08 12:35:04,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:04,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:04,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:04,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:04,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:04,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:04,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:04,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:04,970 INFO L87 Difference]: Start difference. First operand 1572 states and 2166 transitions. Second operand 9 states. [2019-09-08 12:35:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:09,558 INFO L93 Difference]: Finished difference Result 2959 states and 4131 transitions. [2019-09-08 12:35:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:09,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:09,561 INFO L225 Difference]: With dead ends: 2959 [2019-09-08 12:35:09,561 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:35:09,562 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 12:35:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:35:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:35:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2164 transitions. [2019-09-08 12:35:09,732 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2164 transitions. Word has length 118 [2019-09-08 12:35:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:09,732 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2164 transitions. [2019-09-08 12:35:09,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2164 transitions. [2019-09-08 12:35:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:09,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:09,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:09,734 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -663297848, now seen corresponding path program 1 times [2019-09-08 12:35:09,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:09,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:09,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:09,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:09,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:09,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:09,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:09,919 INFO L87 Difference]: Start difference. First operand 1572 states and 2164 transitions. Second operand 9 states. [2019-09-08 12:35:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:13,973 INFO L93 Difference]: Finished difference Result 2883 states and 4008 transitions. [2019-09-08 12:35:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:13,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:13,976 INFO L225 Difference]: With dead ends: 2883 [2019-09-08 12:35:13,976 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:35:13,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:35:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:35:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2162 transitions. [2019-09-08 12:35:14,150 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2162 transitions. Word has length 118 [2019-09-08 12:35:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:14,150 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2162 transitions. [2019-09-08 12:35:14,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2162 transitions. [2019-09-08 12:35:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:14,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:14,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:14,152 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1456886781, now seen corresponding path program 1 times [2019-09-08 12:35:14,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:14,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:14,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:14,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:14,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:14,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:14,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:14,409 INFO L87 Difference]: Start difference. First operand 1572 states and 2162 transitions. Second operand 9 states. [2019-09-08 12:35:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:18,055 INFO L93 Difference]: Finished difference Result 2779 states and 3824 transitions. [2019-09-08 12:35:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:18,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:18,058 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:35:18,058 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:35:18,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:35:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:35:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2160 transitions. [2019-09-08 12:35:18,237 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2160 transitions. Word has length 118 [2019-09-08 12:35:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:18,237 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2160 transitions. [2019-09-08 12:35:18,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2160 transitions. [2019-09-08 12:35:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:18,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:18,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:18,240 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1609401380, now seen corresponding path program 1 times [2019-09-08 12:35:18,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:18,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:18,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:18,436 INFO L87 Difference]: Start difference. First operand 1572 states and 2160 transitions. Second operand 9 states. [2019-09-08 12:35:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:21,918 INFO L93 Difference]: Finished difference Result 2783 states and 3824 transitions. [2019-09-08 12:35:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:21,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:21,922 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:35:21,922 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:35:21,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:35:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:35:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2158 transitions. [2019-09-08 12:35:22,150 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2158 transitions. Word has length 118 [2019-09-08 12:35:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:22,150 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2158 transitions. [2019-09-08 12:35:22,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2158 transitions. [2019-09-08 12:35:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:22,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:22,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:22,153 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1328567384, now seen corresponding path program 1 times [2019-09-08 12:35:22,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:22,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:22,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:22,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:22,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:22,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:22,307 INFO L87 Difference]: Start difference. First operand 1572 states and 2158 transitions. Second operand 9 states. [2019-09-08 12:35:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:26,467 INFO L93 Difference]: Finished difference Result 2959 states and 4119 transitions. [2019-09-08 12:35:26,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:26,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:26,470 INFO L225 Difference]: With dead ends: 2959 [2019-09-08 12:35:26,470 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:35:26,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:35:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:35:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2156 transitions. [2019-09-08 12:35:26,657 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2156 transitions. Word has length 118 [2019-09-08 12:35:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:26,657 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2156 transitions. [2019-09-08 12:35:26,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2156 transitions. [2019-09-08 12:35:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:26,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:26,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:26,660 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2000230473, now seen corresponding path program 1 times [2019-09-08 12:35:26,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:26,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:26,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:26,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:26,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:26,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:26,928 INFO L87 Difference]: Start difference. First operand 1572 states and 2156 transitions. Second operand 9 states. [2019-09-08 12:35:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:31,174 INFO L93 Difference]: Finished difference Result 2883 states and 3998 transitions. [2019-09-08 12:35:31,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:31,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:31,177 INFO L225 Difference]: With dead ends: 2883 [2019-09-08 12:35:31,178 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:35:31,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:35:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:35:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2154 transitions. [2019-09-08 12:35:31,378 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2154 transitions. Word has length 118 [2019-09-08 12:35:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:31,378 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2154 transitions. [2019-09-08 12:35:31,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2154 transitions. [2019-09-08 12:35:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:31,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:31,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:31,381 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1344929323, now seen corresponding path program 1 times [2019-09-08 12:35:31,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:31,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:31,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:31,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:31,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:31,618 INFO L87 Difference]: Start difference. First operand 1572 states and 2154 transitions. Second operand 9 states. [2019-09-08 12:35:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:35,282 INFO L93 Difference]: Finished difference Result 2614 states and 3564 transitions. [2019-09-08 12:35:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:35,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:35,285 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:35:35,285 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:35:35,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:35:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:35:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2152 transitions. [2019-09-08 12:35:35,479 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2152 transitions. Word has length 118 [2019-09-08 12:35:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:35,479 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2152 transitions. [2019-09-08 12:35:35,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2152 transitions. [2019-09-08 12:35:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:35,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:35,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:35,482 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1214970847, now seen corresponding path program 1 times [2019-09-08 12:35:35,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:35,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:35,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:35,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:35,630 INFO L87 Difference]: Start difference. First operand 1572 states and 2152 transitions. Second operand 9 states. [2019-09-08 12:35:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:40,236 INFO L93 Difference]: Finished difference Result 2959 states and 4108 transitions. [2019-09-08 12:35:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:40,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:40,240 INFO L225 Difference]: With dead ends: 2959 [2019-09-08 12:35:40,240 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:35:40,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:35:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:35:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2150 transitions. [2019-09-08 12:35:40,438 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2150 transitions. Word has length 118 [2019-09-08 12:35:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:40,438 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2150 transitions. [2019-09-08 12:35:40,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2150 transitions. [2019-09-08 12:35:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:40,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:40,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:40,440 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2137460873, now seen corresponding path program 1 times [2019-09-08 12:35:40,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:40,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:40,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:40,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:40,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:40,596 INFO L87 Difference]: Start difference. First operand 1572 states and 2150 transitions. Second operand 9 states. [2019-09-08 12:35:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:44,747 INFO L93 Difference]: Finished difference Result 2879 states and 3985 transitions. [2019-09-08 12:35:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:44,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:44,750 INFO L225 Difference]: With dead ends: 2879 [2019-09-08 12:35:44,750 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:35:44,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:35:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:35:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2149 transitions. [2019-09-08 12:35:44,952 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2149 transitions. Word has length 118 [2019-09-08 12:35:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:44,952 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2149 transitions. [2019-09-08 12:35:44,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2149 transitions. [2019-09-08 12:35:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:44,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:44,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:44,954 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 98899166, now seen corresponding path program 1 times [2019-09-08 12:35:44,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:45,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:45,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:45,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:45,130 INFO L87 Difference]: Start difference. First operand 1572 states and 2149 transitions. Second operand 9 states. [2019-09-08 12:35:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:48,717 INFO L93 Difference]: Finished difference Result 2784 states and 3810 transitions. [2019-09-08 12:35:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:48,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:48,720 INFO L225 Difference]: With dead ends: 2784 [2019-09-08 12:35:48,720 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:35:48,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:35:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:35:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2148 transitions. [2019-09-08 12:35:48,921 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2148 transitions. Word has length 118 [2019-09-08 12:35:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:48,921 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2148 transitions. [2019-09-08 12:35:48,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2148 transitions. [2019-09-08 12:35:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:48,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:48,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:48,923 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2028055678, now seen corresponding path program 1 times [2019-09-08 12:35:48,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:48,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:49,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:49,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:49,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:49,105 INFO L87 Difference]: Start difference. First operand 1572 states and 2148 transitions. Second operand 9 states. [2019-09-08 12:35:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:53,581 INFO L93 Difference]: Finished difference Result 2949 states and 4085 transitions. [2019-09-08 12:35:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:53,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:53,584 INFO L225 Difference]: With dead ends: 2949 [2019-09-08 12:35:53,584 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:35:53,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:35:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:35:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2147 transitions. [2019-09-08 12:35:53,801 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2147 transitions. Word has length 118 [2019-09-08 12:35:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:53,801 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2147 transitions. [2019-09-08 12:35:53,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2147 transitions. [2019-09-08 12:35:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:53,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:53,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:53,803 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:53,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:53,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1708413887, now seen corresponding path program 1 times [2019-09-08 12:35:53,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:53,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:53,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:53,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:53,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:53,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:53,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:53,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:53,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:53,978 INFO L87 Difference]: Start difference. First operand 1572 states and 2147 transitions. Second operand 9 states. [2019-09-08 12:35:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:58,075 INFO L93 Difference]: Finished difference Result 2875 states and 3977 transitions. [2019-09-08 12:35:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:35:58,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:35:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:58,079 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:35:58,079 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:35:58,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:35:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:35:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:35:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:35:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2146 transitions. [2019-09-08 12:35:58,400 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2146 transitions. Word has length 118 [2019-09-08 12:35:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:58,400 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2146 transitions. [2019-09-08 12:35:58,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:35:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2146 transitions. [2019-09-08 12:35:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:35:58,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:58,403 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1634117260, now seen corresponding path program 1 times [2019-09-08 12:35:58,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:58,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:58,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:58,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:58,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:35:58,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:35:58,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:35:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:58,563 INFO L87 Difference]: Start difference. First operand 1572 states and 2146 transitions. Second operand 9 states. [2019-09-08 12:36:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:02,821 INFO L93 Difference]: Finished difference Result 2940 states and 4074 transitions. [2019-09-08 12:36:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:02,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:02,825 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 12:36:02,825 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:36:02,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:36:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:36:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2145 transitions. [2019-09-08 12:36:03,039 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2145 transitions. Word has length 118 [2019-09-08 12:36:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:03,039 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2145 transitions. [2019-09-08 12:36:03,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2145 transitions. [2019-09-08 12:36:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:03,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:03,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:03,041 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash 190374528, now seen corresponding path program 1 times [2019-09-08 12:36:03,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:03,230 INFO L87 Difference]: Start difference. First operand 1572 states and 2145 transitions. Second operand 9 states. [2019-09-08 12:36:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:07,345 INFO L93 Difference]: Finished difference Result 2875 states and 3975 transitions. [2019-09-08 12:36:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:07,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:07,349 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:36:07,349 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:07,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2144 transitions. [2019-09-08 12:36:07,564 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2144 transitions. Word has length 118 [2019-09-08 12:36:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:07,564 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2144 transitions. [2019-09-08 12:36:07,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2144 transitions. [2019-09-08 12:36:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:07,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:07,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:07,566 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash 661276899, now seen corresponding path program 1 times [2019-09-08 12:36:07,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:07,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:07,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:07,725 INFO L87 Difference]: Start difference. First operand 1572 states and 2144 transitions. Second operand 9 states. [2019-09-08 12:36:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:12,058 INFO L93 Difference]: Finished difference Result 2875 states and 3973 transitions. [2019-09-08 12:36:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:12,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:12,062 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:36:12,062 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:12,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2143 transitions. [2019-09-08 12:36:12,280 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2143 transitions. Word has length 118 [2019-09-08 12:36:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:12,281 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2143 transitions. [2019-09-08 12:36:12,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2143 transitions. [2019-09-08 12:36:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:12,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:12,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:12,282 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1436168909, now seen corresponding path program 1 times [2019-09-08 12:36:12,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:12,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:12,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:12,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:12,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:12,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:12,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:12,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:12,462 INFO L87 Difference]: Start difference. First operand 1572 states and 2143 transitions. Second operand 9 states. [2019-09-08 12:36:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:16,801 INFO L93 Difference]: Finished difference Result 2879 states and 3976 transitions. [2019-09-08 12:36:16,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:16,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:16,804 INFO L225 Difference]: With dead ends: 2879 [2019-09-08 12:36:16,804 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:16,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2142 transitions. [2019-09-08 12:36:17,025 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2142 transitions. Word has length 118 [2019-09-08 12:36:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:17,025 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2142 transitions. [2019-09-08 12:36:17,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2142 transitions. [2019-09-08 12:36:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:17,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:17,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:17,027 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1268958251, now seen corresponding path program 1 times [2019-09-08 12:36:17,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:17,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:17,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:17,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:17,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:17,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:17,200 INFO L87 Difference]: Start difference. First operand 1572 states and 2142 transitions. Second operand 9 states. [2019-09-08 12:36:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:21,361 INFO L93 Difference]: Finished difference Result 2940 states and 4067 transitions. [2019-09-08 12:36:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:21,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:21,364 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 12:36:21,364 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:36:21,365 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 12:36:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:36:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:36:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2141 transitions. [2019-09-08 12:36:21,591 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2141 transitions. Word has length 118 [2019-09-08 12:36:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:21,592 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2141 transitions. [2019-09-08 12:36:21,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2141 transitions. [2019-09-08 12:36:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:21,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:21,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:21,594 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 302788812, now seen corresponding path program 1 times [2019-09-08 12:36:21,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:21,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:21,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:21,752 INFO L87 Difference]: Start difference. First operand 1572 states and 2141 transitions. Second operand 9 states. [2019-09-08 12:36:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:26,061 INFO L93 Difference]: Finished difference Result 2875 states and 3969 transitions. [2019-09-08 12:36:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:26,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:26,064 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:36:26,065 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:26,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2140 transitions. [2019-09-08 12:36:26,289 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2140 transitions. Word has length 118 [2019-09-08 12:36:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:26,290 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2140 transitions. [2019-09-08 12:36:26,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2140 transitions. [2019-09-08 12:36:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:26,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:26,291 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1718311127, now seen corresponding path program 1 times [2019-09-08 12:36:26,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:26,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:26,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:26,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:26,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:26,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:26,441 INFO L87 Difference]: Start difference. First operand 1572 states and 2140 transitions. Second operand 9 states. [2019-09-08 12:36:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:30,879 INFO L93 Difference]: Finished difference Result 2874 states and 3967 transitions. [2019-09-08 12:36:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:30,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:30,882 INFO L225 Difference]: With dead ends: 2874 [2019-09-08 12:36:30,882 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:30,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2139 transitions. [2019-09-08 12:36:31,110 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2139 transitions. Word has length 118 [2019-09-08 12:36:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:31,110 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2139 transitions. [2019-09-08 12:36:31,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2139 transitions. [2019-09-08 12:36:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:31,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:31,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:31,112 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1719479256, now seen corresponding path program 1 times [2019-09-08 12:36:31,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:31,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:31,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:31,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:31,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:31,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:31,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:31,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:31,287 INFO L87 Difference]: Start difference. First operand 1572 states and 2139 transitions. Second operand 9 states. [2019-09-08 12:36:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:35,769 INFO L93 Difference]: Finished difference Result 2875 states and 3967 transitions. [2019-09-08 12:36:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:35,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:35,772 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:36:35,772 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:35,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2138 transitions. [2019-09-08 12:36:36,048 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2138 transitions. Word has length 118 [2019-09-08 12:36:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:36,048 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2138 transitions. [2019-09-08 12:36:36,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2138 transitions. [2019-09-08 12:36:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:36,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:36,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:36,050 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1598048276, now seen corresponding path program 1 times [2019-09-08 12:36:36,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:36,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:36,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:36,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:36,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:36,250 INFO L87 Difference]: Start difference. First operand 1572 states and 2138 transitions. Second operand 9 states. [2019-09-08 12:36:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:40,546 INFO L93 Difference]: Finished difference Result 2874 states and 3964 transitions. [2019-09-08 12:36:40,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:40,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:40,550 INFO L225 Difference]: With dead ends: 2874 [2019-09-08 12:36:40,550 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:40,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2137 transitions. [2019-09-08 12:36:40,786 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2137 transitions. Word has length 118 [2019-09-08 12:36:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:40,786 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2137 transitions. [2019-09-08 12:36:40,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2137 transitions. [2019-09-08 12:36:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:40,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:40,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:40,788 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash -988448613, now seen corresponding path program 1 times [2019-09-08 12:36:40,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:40,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:40,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:40,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:40,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:40,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:40,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:40,947 INFO L87 Difference]: Start difference. First operand 1572 states and 2137 transitions. Second operand 9 states. [2019-09-08 12:36:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:45,157 INFO L93 Difference]: Finished difference Result 2874 states and 3962 transitions. [2019-09-08 12:36:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:45,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:45,160 INFO L225 Difference]: With dead ends: 2874 [2019-09-08 12:36:45,160 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:45,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2136 transitions. [2019-09-08 12:36:45,400 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2136 transitions. Word has length 118 [2019-09-08 12:36:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:45,401 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2136 transitions. [2019-09-08 12:36:45,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2136 transitions. [2019-09-08 12:36:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:36:45,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:45,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:45,402 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1394299562, now seen corresponding path program 1 times [2019-09-08 12:36:45,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:45,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:45,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:45,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:45,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:45,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:45,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:45,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:45,568 INFO L87 Difference]: Start difference. First operand 1572 states and 2136 transitions. Second operand 9 states. [2019-09-08 12:36:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:49,802 INFO L93 Difference]: Finished difference Result 2935 states and 4054 transitions. [2019-09-08 12:36:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:49,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:36:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:49,806 INFO L225 Difference]: With dead ends: 2935 [2019-09-08 12:36:49,806 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:36:49,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:36:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:36:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:36:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2135 transitions. [2019-09-08 12:36:50,047 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2135 transitions. Word has length 118 [2019-09-08 12:36:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:50,048 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2135 transitions. [2019-09-08 12:36:50,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2135 transitions. [2019-09-08 12:36:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:36:50,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:50,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:50,049 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash -524771572, now seen corresponding path program 1 times [2019-09-08 12:36:50,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:50,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:50,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:50,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:50,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:50,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:50,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:50,203 INFO L87 Difference]: Start difference. First operand 1572 states and 2135 transitions. Second operand 9 states. [2019-09-08 12:36:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:53,775 INFO L93 Difference]: Finished difference Result 2780 states and 3792 transitions. [2019-09-08 12:36:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:53,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:36:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:53,778 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 12:36:53,778 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:36:53,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:36:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:36:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:36:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2134 transitions. [2019-09-08 12:36:54,024 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2134 transitions. Word has length 119 [2019-09-08 12:36:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:54,024 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2134 transitions. [2019-09-08 12:36:54,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2134 transitions. [2019-09-08 12:36:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:36:54,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:54,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:54,026 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:54,026 INFO L82 PathProgramCache]: Analyzing trace with hash 438986769, now seen corresponding path program 1 times [2019-09-08 12:36:54,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:54,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:54,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:54,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:54,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:54,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:54,182 INFO L87 Difference]: Start difference. First operand 1572 states and 2134 transitions. Second operand 9 states. [2019-09-08 12:36:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:58,368 INFO L93 Difference]: Finished difference Result 2891 states and 3979 transitions. [2019-09-08 12:36:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:36:58,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:36:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:58,371 INFO L225 Difference]: With dead ends: 2891 [2019-09-08 12:36:58,371 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:36:58,372 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 12:36:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:36:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:36:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:36:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2132 transitions. [2019-09-08 12:36:58,627 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2132 transitions. Word has length 120 [2019-09-08 12:36:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:58,627 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2132 transitions. [2019-09-08 12:36:58,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:36:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2132 transitions. [2019-09-08 12:36:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:36:58,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:58,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:58,629 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1490169743, now seen corresponding path program 1 times [2019-09-08 12:36:58,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:58,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:58,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:58,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:36:58,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:36:58,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:36:58,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:58,791 INFO L87 Difference]: Start difference. First operand 1572 states and 2132 transitions. Second operand 9 states. [2019-09-08 12:37:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:02,858 INFO L93 Difference]: Finished difference Result 2787 states and 3796 transitions. [2019-09-08 12:37:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:02,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:02,862 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:37:02,862 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:02,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2130 transitions. [2019-09-08 12:37:03,148 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2130 transitions. Word has length 120 [2019-09-08 12:37:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:03,148 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2130 transitions. [2019-09-08 12:37:03,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2130 transitions. [2019-09-08 12:37:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:03,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:03,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:03,150 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:03,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1643582949, now seen corresponding path program 1 times [2019-09-08 12:37:03,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:03,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:03,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:03,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:03,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:03,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:03,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:03,312 INFO L87 Difference]: Start difference. First operand 1572 states and 2130 transitions. Second operand 9 states. [2019-09-08 12:37:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:07,353 INFO L93 Difference]: Finished difference Result 2787 states and 3794 transitions. [2019-09-08 12:37:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:07,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:07,356 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:37:07,356 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:07,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2128 transitions. [2019-09-08 12:37:07,611 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2128 transitions. Word has length 120 [2019-09-08 12:37:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:07,611 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2128 transitions. [2019-09-08 12:37:07,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2128 transitions. [2019-09-08 12:37:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:07,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:07,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:07,613 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash -526309723, now seen corresponding path program 1 times [2019-09-08 12:37:07,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:07,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:07,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:07,795 INFO L87 Difference]: Start difference. First operand 1572 states and 2128 transitions. Second operand 9 states. [2019-09-08 12:37:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:11,590 INFO L93 Difference]: Finished difference Result 2783 states and 3785 transitions. [2019-09-08 12:37:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:11,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:11,593 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:37:11,593 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:11,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:37:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2126 transitions. [2019-09-08 12:37:11,853 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2126 transitions. Word has length 120 [2019-09-08 12:37:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:11,853 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2126 transitions. [2019-09-08 12:37:11,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2126 transitions. [2019-09-08 12:37:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:11,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:11,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:11,855 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1818410374, now seen corresponding path program 1 times [2019-09-08 12:37:11,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:11,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:12,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:12,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:12,010 INFO L87 Difference]: Start difference. First operand 1572 states and 2126 transitions. Second operand 9 states. [2019-09-08 12:37:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:15,825 INFO L93 Difference]: Finished difference Result 2783 states and 3783 transitions. [2019-09-08 12:37:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:15,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:15,828 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:37:15,828 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:15,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:37:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2124 transitions. [2019-09-08 12:37:16,090 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2124 transitions. Word has length 120 [2019-09-08 12:37:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:16,090 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2124 transitions. [2019-09-08 12:37:16,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2124 transitions. [2019-09-08 12:37:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:16,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:16,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:16,092 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2031462205, now seen corresponding path program 1 times [2019-09-08 12:37:16,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:16,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:16,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:16,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:16,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:16,250 INFO L87 Difference]: Start difference. First operand 1572 states and 2124 transitions. Second operand 9 states. [2019-09-08 12:37:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,182 INFO L93 Difference]: Finished difference Result 2783 states and 3779 transitions. [2019-09-08 12:37:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:20,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,185 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:37:20,185 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:20,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2122 transitions. [2019-09-08 12:37:20,456 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2122 transitions. Word has length 120 [2019-09-08 12:37:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:20,456 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2122 transitions. [2019-09-08 12:37:20,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2122 transitions. [2019-09-08 12:37:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:20,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:20,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:20,458 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash -34663321, now seen corresponding path program 1 times [2019-09-08 12:37:20,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:20,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:20,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:20,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:20,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:20,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:20,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:20,625 INFO L87 Difference]: Start difference. First operand 1572 states and 2122 transitions. Second operand 9 states. [2019-09-08 12:37:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:25,203 INFO L93 Difference]: Finished difference Result 2889 states and 3958 transitions. [2019-09-08 12:37:25,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:25,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:25,208 INFO L225 Difference]: With dead ends: 2889 [2019-09-08 12:37:25,208 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:37:25,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:37:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:37:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2120 transitions. [2019-09-08 12:37:25,499 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2120 transitions. Word has length 120 [2019-09-08 12:37:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:25,499 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2120 transitions. [2019-09-08 12:37:25,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2120 transitions. [2019-09-08 12:37:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:25,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:25,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:25,505 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 462579645, now seen corresponding path program 1 times [2019-09-08 12:37:25,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:25,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:25,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:25,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:25,662 INFO L87 Difference]: Start difference. First operand 1572 states and 2120 transitions. Second operand 9 states. [2019-09-08 12:37:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:29,829 INFO L93 Difference]: Finished difference Result 2891 states and 3957 transitions. [2019-09-08 12:37:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:29,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:29,832 INFO L225 Difference]: With dead ends: 2891 [2019-09-08 12:37:29,832 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:37:29,833 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 12:37:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:37:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:37:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2118 transitions. [2019-09-08 12:37:30,114 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2118 transitions. Word has length 120 [2019-09-08 12:37:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:30,114 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2118 transitions. [2019-09-08 12:37:30,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2118 transitions. [2019-09-08 12:37:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:30,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:30,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:30,116 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1466576867, now seen corresponding path program 1 times [2019-09-08 12:37:30,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:30,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:30,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:30,310 INFO L87 Difference]: Start difference. First operand 1572 states and 2118 transitions. Second operand 9 states. [2019-09-08 12:37:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:34,166 INFO L93 Difference]: Finished difference Result 2787 states and 3778 transitions. [2019-09-08 12:37:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:34,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:34,170 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:37:34,170 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:34,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2116 transitions. [2019-09-08 12:37:34,447 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2116 transitions. Word has length 120 [2019-09-08 12:37:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:34,447 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2116 transitions. [2019-09-08 12:37:34,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2116 transitions. [2019-09-08 12:37:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:34,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:34,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:34,449 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -502475548, now seen corresponding path program 1 times [2019-09-08 12:37:34,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:34,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:34,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:34,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:34,612 INFO L87 Difference]: Start difference. First operand 1572 states and 2116 transitions. Second operand 9 states. [2019-09-08 12:37:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:38,415 INFO L93 Difference]: Finished difference Result 2783 states and 3771 transitions. [2019-09-08 12:37:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:38,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:38,418 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:37:38,418 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:38,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:37:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2114 transitions. [2019-09-08 12:37:38,696 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2114 transitions. Word has length 120 [2019-09-08 12:37:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:38,696 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2114 transitions. [2019-09-08 12:37:38,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2114 transitions. [2019-09-08 12:37:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:38,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:38,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:38,698 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1493972807, now seen corresponding path program 1 times [2019-09-08 12:37:38,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:38,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:38,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 12:37:38,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:38,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:38,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:38,847 INFO L87 Difference]: Start difference. First operand 1572 states and 2114 transitions. Second operand 9 states. [2019-09-08 12:37:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:43,167 INFO L93 Difference]: Finished difference Result 2889 states and 3944 transitions. [2019-09-08 12:37:43,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:43,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:43,170 INFO L225 Difference]: With dead ends: 2889 [2019-09-08 12:37:43,170 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:37:43,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:37:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:37:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2112 transitions. [2019-09-08 12:37:43,450 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2112 transitions. Word has length 120 [2019-09-08 12:37:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:43,450 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2112 transitions. [2019-09-08 12:37:43,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2112 transitions. [2019-09-08 12:37:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:43,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:43,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:43,452 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2061061959, now seen corresponding path program 1 times [2019-09-08 12:37:43,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:43,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:43,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:43,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:43,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:43,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:43,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:43,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:43,612 INFO L87 Difference]: Start difference. First operand 1572 states and 2112 transitions. Second operand 9 states. [2019-09-08 12:37:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:47,602 INFO L93 Difference]: Finished difference Result 2979 states and 4074 transitions. [2019-09-08 12:37:47,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:47,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:47,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:47,605 INFO L225 Difference]: With dead ends: 2979 [2019-09-08 12:37:47,605 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 12:37:47,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 12:37:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-08 12:37:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2110 transitions. [2019-09-08 12:37:47,890 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2110 transitions. Word has length 120 [2019-09-08 12:37:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:47,890 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2110 transitions. [2019-09-08 12:37:47,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2110 transitions. [2019-09-08 12:37:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:47,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:47,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:47,893 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1566617361, now seen corresponding path program 1 times [2019-09-08 12:37:47,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:47,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:48,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:48,064 INFO L87 Difference]: Start difference. First operand 1572 states and 2110 transitions. Second operand 9 states. [2019-09-08 12:37:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:51,975 INFO L93 Difference]: Finished difference Result 2787 states and 3770 transitions. [2019-09-08 12:37:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:51,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:51,978 INFO L225 Difference]: With dead ends: 2787 [2019-09-08 12:37:51,979 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:37:51,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:37:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:37:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2108 transitions. [2019-09-08 12:37:52,305 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2108 transitions. Word has length 120 [2019-09-08 12:37:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:52,305 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2108 transitions. [2019-09-08 12:37:52,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2108 transitions. [2019-09-08 12:37:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:52,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:52,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:52,307 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash -799193423, now seen corresponding path program 1 times [2019-09-08 12:37:52,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:52,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:52,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:52,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:52,470 INFO L87 Difference]: Start difference. First operand 1572 states and 2108 transitions. Second operand 9 states. [2019-09-08 12:37:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:56,866 INFO L93 Difference]: Finished difference Result 2891 states and 3941 transitions. [2019-09-08 12:37:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:56,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:37:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:56,870 INFO L225 Difference]: With dead ends: 2891 [2019-09-08 12:37:56,870 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:37:56,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:37:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:37:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:37:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2106 transitions. [2019-09-08 12:37:57,162 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2106 transitions. Word has length 120 [2019-09-08 12:37:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:57,162 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2106 transitions. [2019-09-08 12:37:57,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2106 transitions. [2019-09-08 12:37:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:57,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:57,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:57,164 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1289509032, now seen corresponding path program 1 times [2019-09-08 12:37:57,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:57,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:57,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:57,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:57,327 INFO L87 Difference]: Start difference. First operand 1572 states and 2106 transitions. Second operand 9 states. [2019-09-08 12:38:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:01,198 INFO L93 Difference]: Finished difference Result 2783 states and 3761 transitions. [2019-09-08 12:38:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:01,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:01,202 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:38:01,202 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:01,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2104 transitions. [2019-09-08 12:38:01,499 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2104 transitions. Word has length 120 [2019-09-08 12:38:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:01,500 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2104 transitions. [2019-09-08 12:38:01,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2104 transitions. [2019-09-08 12:38:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:01,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:01,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:01,502 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1774124078, now seen corresponding path program 1 times [2019-09-08 12:38:01,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:01,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:01,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:01,667 INFO L87 Difference]: Start difference. First operand 1572 states and 2104 transitions. Second operand 9 states. [2019-09-08 12:38:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:05,776 INFO L93 Difference]: Finished difference Result 2779 states and 3753 transitions. [2019-09-08 12:38:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:05,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:05,779 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:38:05,779 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:05,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2102 transitions. [2019-09-08 12:38:06,077 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2102 transitions. Word has length 120 [2019-09-08 12:38:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:06,077 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2102 transitions. [2019-09-08 12:38:06,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2102 transitions. [2019-09-08 12:38:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:06,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:06,079 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1734122598, now seen corresponding path program 1 times [2019-09-08 12:38:06,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:06,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:06,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:06,246 INFO L87 Difference]: Start difference. First operand 1572 states and 2102 transitions. Second operand 9 states. [2019-09-08 12:38:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:10,490 INFO L93 Difference]: Finished difference Result 2885 states and 3926 transitions. [2019-09-08 12:38:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:10,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:10,493 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 12:38:10,493 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:38:10,494 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 12:38:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:38:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:38:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2100 transitions. [2019-09-08 12:38:10,797 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2100 transitions. Word has length 120 [2019-09-08 12:38:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:10,798 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2100 transitions. [2019-09-08 12:38:10,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2100 transitions. [2019-09-08 12:38:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:10,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:10,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:10,799 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -928740028, now seen corresponding path program 1 times [2019-09-08 12:38:10,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:10,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:10,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:10,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:10,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:10,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:10,984 INFO L87 Difference]: Start difference. First operand 1572 states and 2100 transitions. Second operand 9 states. [2019-09-08 12:38:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:14,954 INFO L93 Difference]: Finished difference Result 2783 states and 3753 transitions. [2019-09-08 12:38:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:14,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:14,957 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:38:14,957 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:14,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2098 transitions. [2019-09-08 12:38:15,300 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2098 transitions. Word has length 120 [2019-09-08 12:38:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:15,300 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2098 transitions. [2019-09-08 12:38:15,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2098 transitions. [2019-09-08 12:38:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:15,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:15,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:15,303 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1993016462, now seen corresponding path program 1 times [2019-09-08 12:38:15,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:15,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:15,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:15,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:15,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:15,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:15,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:15,501 INFO L87 Difference]: Start difference. First operand 1572 states and 2098 transitions. Second operand 9 states. [2019-09-08 12:38:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:19,684 INFO L93 Difference]: Finished difference Result 2779 states and 3747 transitions. [2019-09-08 12:38:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:19,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:19,687 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:38:19,688 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:19,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2096 transitions. [2019-09-08 12:38:19,998 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2096 transitions. Word has length 120 [2019-09-08 12:38:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:19,998 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2096 transitions. [2019-09-08 12:38:19,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2096 transitions. [2019-09-08 12:38:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:19,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:20,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:20,000 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2093888074, now seen corresponding path program 1 times [2019-09-08 12:38:20,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:20,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:20,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:20,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:20,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:20,175 INFO L87 Difference]: Start difference. First operand 1572 states and 2096 transitions. Second operand 9 states. [2019-09-08 12:38:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:24,578 INFO L93 Difference]: Finished difference Result 2883 states and 3913 transitions. [2019-09-08 12:38:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:24,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:24,581 INFO L225 Difference]: With dead ends: 2883 [2019-09-08 12:38:24,582 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:38:24,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:38:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:38:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2094 transitions. [2019-09-08 12:38:24,890 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2094 transitions. Word has length 120 [2019-09-08 12:38:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:24,890 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2094 transitions. [2019-09-08 12:38:24,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2094 transitions. [2019-09-08 12:38:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:24,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:24,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:24,892 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2079343493, now seen corresponding path program 1 times [2019-09-08 12:38:24,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:24,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:24,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:24,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:25,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:25,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:25,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:25,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:25,079 INFO L87 Difference]: Start difference. First operand 1572 states and 2094 transitions. Second operand 9 states. [2019-09-08 12:38:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:29,480 INFO L93 Difference]: Finished difference Result 2885 states and 3910 transitions. [2019-09-08 12:38:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:29,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:29,483 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 12:38:29,483 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:38:29,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:38:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:38:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2092 transitions. [2019-09-08 12:38:29,795 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2092 transitions. Word has length 120 [2019-09-08 12:38:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:29,796 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2092 transitions. [2019-09-08 12:38:29,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2092 transitions. [2019-09-08 12:38:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:29,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:29,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:29,798 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:29,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1273960923, now seen corresponding path program 1 times [2019-09-08 12:38:29,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:29,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:29,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:29,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:29,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:29,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:29,956 INFO L87 Difference]: Start difference. First operand 1572 states and 2092 transitions. Second operand 9 states. [2019-09-08 12:38:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:34,339 INFO L93 Difference]: Finished difference Result 2783 states and 3745 transitions. [2019-09-08 12:38:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:34,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:34,342 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:38:34,342 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:34,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2090 transitions. [2019-09-08 12:38:34,656 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2090 transitions. Word has length 120 [2019-09-08 12:38:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:34,656 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2090 transitions. [2019-09-08 12:38:34,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2090 transitions. [2019-09-08 12:38:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:34,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:34,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:34,659 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 944288137, now seen corresponding path program 1 times [2019-09-08 12:38:34,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:34,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:34,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:34,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:34,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:34,824 INFO L87 Difference]: Start difference. First operand 1572 states and 2090 transitions. Second operand 9 states. [2019-09-08 12:38:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:38,749 INFO L93 Difference]: Finished difference Result 2783 states and 3743 transitions. [2019-09-08 12:38:38,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:38,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:38,753 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:38:38,753 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:38,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2088 transitions. [2019-09-08 12:38:39,115 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2088 transitions. Word has length 120 [2019-09-08 12:38:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:39,115 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2088 transitions. [2019-09-08 12:38:39,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2088 transitions. [2019-09-08 12:38:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:39,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:39,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:39,117 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -349907354, now seen corresponding path program 1 times [2019-09-08 12:38:39,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:39,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:39,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:39,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:39,279 INFO L87 Difference]: Start difference. First operand 1572 states and 2088 transitions. Second operand 9 states. [2019-09-08 12:38:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:43,115 INFO L93 Difference]: Finished difference Result 2779 states and 3735 transitions. [2019-09-08 12:38:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:43,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:43,119 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:38:43,119 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:43,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2086 transitions. [2019-09-08 12:38:43,448 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2086 transitions. Word has length 120 [2019-09-08 12:38:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:43,449 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2086 transitions. [2019-09-08 12:38:43,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2086 transitions. [2019-09-08 12:38:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:43,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:43,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:43,450 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -3622801, now seen corresponding path program 1 times [2019-09-08 12:38:43,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:43,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:43,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:43,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:43,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 12:38:43,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:43,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:43,640 INFO L87 Difference]: Start difference. First operand 1572 states and 2086 transitions. Second operand 9 states. [2019-09-08 12:38:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:48,010 INFO L93 Difference]: Finished difference Result 2714 states and 3643 transitions. [2019-09-08 12:38:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:48,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:48,014 INFO L225 Difference]: With dead ends: 2714 [2019-09-08 12:38:48,014 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:38:48,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:38:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:38:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2084 transitions. [2019-09-08 12:38:48,339 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2084 transitions. Word has length 120 [2019-09-08 12:38:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:48,339 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2084 transitions. [2019-09-08 12:38:48,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2084 transitions. [2019-09-08 12:38:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:48,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:48,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:48,340 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 381425360, now seen corresponding path program 1 times [2019-09-08 12:38:48,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:48,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:48,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:48,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:48,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:48,499 INFO L87 Difference]: Start difference. First operand 1572 states and 2084 transitions. Second operand 9 states. [2019-09-08 12:38:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:52,449 INFO L93 Difference]: Finished difference Result 2614 states and 3483 transitions. [2019-09-08 12:38:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:52,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:52,452 INFO L225 Difference]: With dead ends: 2614 [2019-09-08 12:38:52,452 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:38:52,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:38:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:38:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2082 transitions. [2019-09-08 12:38:52,782 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2082 transitions. Word has length 120 [2019-09-08 12:38:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:52,782 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2082 transitions. [2019-09-08 12:38:52,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2082 transitions. [2019-09-08 12:38:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:52,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:52,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:52,784 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash 663554906, now seen corresponding path program 1 times [2019-09-08 12:38:52,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:52,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:52,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:52,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:52,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:52,941 INFO L87 Difference]: Start difference. First operand 1572 states and 2082 transitions. Second operand 9 states. [2019-09-08 12:38:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:57,193 INFO L93 Difference]: Finished difference Result 2885 states and 3890 transitions. [2019-09-08 12:38:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:57,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:38:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:57,196 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 12:38:57,196 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:38:57,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:38:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:38:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:38:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2080 transitions. [2019-09-08 12:38:57,532 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2080 transitions. Word has length 120 [2019-09-08 12:38:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:57,532 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2080 transitions. [2019-09-08 12:38:57,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2080 transitions. [2019-09-08 12:38:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:38:57,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:57,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:57,533 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1468937476, now seen corresponding path program 1 times [2019-09-08 12:38:57,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:57,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:57,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:57,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:57,731 INFO L87 Difference]: Start difference. First operand 1572 states and 2080 transitions. Second operand 9 states. [2019-09-08 12:39:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:01,814 INFO L93 Difference]: Finished difference Result 2783 states and 3731 transitions. [2019-09-08 12:39:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:01,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:01,817 INFO L225 Difference]: With dead ends: 2783 [2019-09-08 12:39:01,817 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:01,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2078 transitions. [2019-09-08 12:39:02,198 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2078 transitions. Word has length 120 [2019-09-08 12:39:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:02,199 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2078 transitions. [2019-09-08 12:39:02,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2078 transitions. [2019-09-08 12:39:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:02,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:02,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:02,200 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1182548337, now seen corresponding path program 1 times [2019-09-08 12:39:02,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:02,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:02,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:02,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:02,361 INFO L87 Difference]: Start difference. First operand 1572 states and 2078 transitions. Second operand 9 states. [2019-09-08 12:39:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:06,473 INFO L93 Difference]: Finished difference Result 2884 states and 3884 transitions. [2019-09-08 12:39:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:06,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:06,477 INFO L225 Difference]: With dead ends: 2884 [2019-09-08 12:39:06,477 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:39:06,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:39:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:39:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2077 transitions. [2019-09-08 12:39:06,818 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2077 transitions. Word has length 120 [2019-09-08 12:39:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:06,819 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2077 transitions. [2019-09-08 12:39:06,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2077 transitions. [2019-09-08 12:39:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:06,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:06,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:06,820 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash 215975840, now seen corresponding path program 1 times [2019-09-08 12:39:06,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:06,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:06,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:06,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:06,980 INFO L87 Difference]: Start difference. First operand 1572 states and 2077 transitions. Second operand 9 states. [2019-09-08 12:39:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:11,100 INFO L93 Difference]: Finished difference Result 2781 states and 3726 transitions. [2019-09-08 12:39:11,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:11,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:11,104 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:11,104 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:11,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2076 transitions. [2019-09-08 12:39:11,461 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2076 transitions. Word has length 120 [2019-09-08 12:39:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:11,461 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2076 transitions. [2019-09-08 12:39:11,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2076 transitions. [2019-09-08 12:39:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:11,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:11,463 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1907822779, now seen corresponding path program 1 times [2019-09-08 12:39:11,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:11,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:11,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:11,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:11,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:11,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:11,623 INFO L87 Difference]: Start difference. First operand 1572 states and 2076 transitions. Second operand 9 states. [2019-09-08 12:39:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:16,037 INFO L93 Difference]: Finished difference Result 2784 states and 3728 transitions. [2019-09-08 12:39:16,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:16,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:16,040 INFO L225 Difference]: With dead ends: 2784 [2019-09-08 12:39:16,040 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:16,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2075 transitions. [2019-09-08 12:39:16,392 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2075 transitions. Word has length 120 [2019-09-08 12:39:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:16,393 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2075 transitions. [2019-09-08 12:39:16,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2075 transitions. [2019-09-08 12:39:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:16,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:16,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:16,394 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1734271359, now seen corresponding path program 1 times [2019-09-08 12:39:16,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:16,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:16,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:16,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:16,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:16,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:16,554 INFO L87 Difference]: Start difference. First operand 1572 states and 2075 transitions. Second operand 9 states. [2019-09-08 12:39:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:21,031 INFO L93 Difference]: Finished difference Result 2781 states and 3723 transitions. [2019-09-08 12:39:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:21,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:21,034 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:21,034 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:21,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2074 transitions. [2019-09-08 12:39:21,391 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2074 transitions. Word has length 120 [2019-09-08 12:39:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:21,391 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2074 transitions. [2019-09-08 12:39:21,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2074 transitions. [2019-09-08 12:39:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:21,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:21,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:21,393 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:21,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1289176642, now seen corresponding path program 1 times [2019-09-08 12:39:21,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:21,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:21,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:21,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:21,559 INFO L87 Difference]: Start difference. First operand 1572 states and 2074 transitions. Second operand 9 states. [2019-09-08 12:39:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:25,542 INFO L93 Difference]: Finished difference Result 2781 states and 3721 transitions. [2019-09-08 12:39:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:25,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:25,546 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:25,546 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:25,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2073 transitions. [2019-09-08 12:39:25,906 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2073 transitions. Word has length 120 [2019-09-08 12:39:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:25,906 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2073 transitions. [2019-09-08 12:39:25,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2073 transitions. [2019-09-08 12:39:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:25,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:25,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:25,908 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:25,908 INFO L82 PathProgramCache]: Analyzing trace with hash 708898247, now seen corresponding path program 1 times [2019-09-08 12:39:25,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:26,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:26,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:26,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:26,062 INFO L87 Difference]: Start difference. First operand 1572 states and 2073 transitions. Second operand 9 states. [2019-09-08 12:39:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:30,665 INFO L93 Difference]: Finished difference Result 2879 states and 3872 transitions. [2019-09-08 12:39:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:30,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:30,668 INFO L225 Difference]: With dead ends: 2879 [2019-09-08 12:39:30,668 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:39:30,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:39:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:39:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2072 transitions. [2019-09-08 12:39:31,022 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2072 transitions. Word has length 120 [2019-09-08 12:39:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:31,022 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2072 transitions. [2019-09-08 12:39:31,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2072 transitions. [2019-09-08 12:39:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:31,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:31,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:31,024 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1239740929, now seen corresponding path program 1 times [2019-09-08 12:39:31,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:31,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:31,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:31,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:31,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:31,182 INFO L87 Difference]: Start difference. First operand 1572 states and 2072 transitions. Second operand 9 states. [2019-09-08 12:39:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:35,727 INFO L93 Difference]: Finished difference Result 2874 states and 3866 transitions. [2019-09-08 12:39:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:35,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:35,730 INFO L225 Difference]: With dead ends: 2874 [2019-09-08 12:39:35,731 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:39:35,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:39:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:39:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2071 transitions. [2019-09-08 12:39:36,091 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2071 transitions. Word has length 120 [2019-09-08 12:39:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:36,092 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2071 transitions. [2019-09-08 12:39:36,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2071 transitions. [2019-09-08 12:39:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:36,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:36,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:36,093 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2071805120, now seen corresponding path program 1 times [2019-09-08 12:39:36,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:36,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:36,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:36,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:36,252 INFO L87 Difference]: Start difference. First operand 1572 states and 2071 transitions. Second operand 9 states. [2019-09-08 12:39:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:40,342 INFO L93 Difference]: Finished difference Result 2781 states and 3718 transitions. [2019-09-08 12:39:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:40,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:40,345 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:40,345 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:40,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2070 transitions. [2019-09-08 12:39:40,710 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2070 transitions. Word has length 120 [2019-09-08 12:39:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:40,710 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2070 transitions. [2019-09-08 12:39:40,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2070 transitions. [2019-09-08 12:39:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:40,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:40,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:40,711 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash -597710621, now seen corresponding path program 1 times [2019-09-08 12:39:40,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:40,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:40,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:40,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:40,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:40,874 INFO L87 Difference]: Start difference. First operand 1572 states and 2070 transitions. Second operand 9 states. [2019-09-08 12:39:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:45,019 INFO L93 Difference]: Finished difference Result 2781 states and 3716 transitions. [2019-09-08 12:39:45,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:45,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:45,023 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:45,023 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:45,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2069 transitions. [2019-09-08 12:39:45,448 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2069 transitions. Word has length 120 [2019-09-08 12:39:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:45,448 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2069 transitions. [2019-09-08 12:39:45,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2069 transitions. [2019-09-08 12:39:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:45,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:45,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:45,450 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2018866561, now seen corresponding path program 1 times [2019-09-08 12:39:45,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:45,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:45,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:45,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:45,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:45,601 INFO L87 Difference]: Start difference. First operand 1572 states and 2069 transitions. Second operand 9 states. [2019-09-08 12:39:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:49,873 INFO L93 Difference]: Finished difference Result 2784 states and 3717 transitions. [2019-09-08 12:39:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:49,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:49,877 INFO L225 Difference]: With dead ends: 2784 [2019-09-08 12:39:49,877 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:49,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2068 transitions. [2019-09-08 12:39:50,254 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2068 transitions. Word has length 120 [2019-09-08 12:39:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:50,254 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2068 transitions. [2019-09-08 12:39:50,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2068 transitions. [2019-09-08 12:39:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:50,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:50,256 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -152615904, now seen corresponding path program 1 times [2019-09-08 12:39:50,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:50,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:50,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:50,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:50,423 INFO L87 Difference]: Start difference. First operand 1572 states and 2068 transitions. Second operand 9 states. [2019-09-08 12:39:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:54,620 INFO L93 Difference]: Finished difference Result 2781 states and 3712 transitions. [2019-09-08 12:39:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:54,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:54,623 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:54,623 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:54,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:39:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2067 transitions. [2019-09-08 12:39:55,003 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2067 transitions. Word has length 120 [2019-09-08 12:39:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:55,003 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2067 transitions. [2019-09-08 12:39:55,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2067 transitions. [2019-09-08 12:39:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:55,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:55,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:55,004 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1134633556, now seen corresponding path program 1 times [2019-09-08 12:39:55,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:55,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:55,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:55,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:55,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:55,168 INFO L87 Difference]: Start difference. First operand 1572 states and 2067 transitions. Second operand 9 states. [2019-09-08 12:39:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:59,190 INFO L93 Difference]: Finished difference Result 2781 states and 3711 transitions. [2019-09-08 12:39:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:59,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:39:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:59,193 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:39:59,193 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:39:59,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:39:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:39:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:39:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2066 transitions. [2019-09-08 12:39:59,570 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2066 transitions. Word has length 120 [2019-09-08 12:39:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:59,570 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2066 transitions. [2019-09-08 12:39:59,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2066 transitions. [2019-09-08 12:39:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:39:59,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:59,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:59,572 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1989155418, now seen corresponding path program 1 times [2019-09-08 12:39:59,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:59,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:59,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:59,732 INFO L87 Difference]: Start difference. First operand 1572 states and 2066 transitions. Second operand 9 states. [2019-09-08 12:40:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:03,795 INFO L93 Difference]: Finished difference Result 2779 states and 3707 transitions. [2019-09-08 12:40:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:03,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:03,799 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:03,799 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:03,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2065 transitions. [2019-09-08 12:40:04,227 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2065 transitions. Word has length 120 [2019-09-08 12:40:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:04,227 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2065 transitions. [2019-09-08 12:40:04,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2065 transitions. [2019-09-08 12:40:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:04,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:04,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:04,229 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash 136702110, now seen corresponding path program 1 times [2019-09-08 12:40:04,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:04,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:04,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:04,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:04,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:04,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 12:40:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:04,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:04,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:04,390 INFO L87 Difference]: Start difference. First operand 1572 states and 2065 transitions. Second operand 9 states. [2019-09-08 12:40:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:08,695 INFO L93 Difference]: Finished difference Result 2879 states and 3859 transitions. [2019-09-08 12:40:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:08,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:08,699 INFO L225 Difference]: With dead ends: 2879 [2019-09-08 12:40:08,700 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:40:08,700 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 12:40:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:40:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:40:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2064 transitions. [2019-09-08 12:40:09,096 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2064 transitions. Word has length 120 [2019-09-08 12:40:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:09,097 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2064 transitions. [2019-09-08 12:40:09,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2064 transitions. [2019-09-08 12:40:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:09,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:09,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:09,099 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 942084680, now seen corresponding path program 1 times [2019-09-08 12:40:09,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:09,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:09,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:09,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:09,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:09,252 INFO L87 Difference]: Start difference. First operand 1572 states and 2064 transitions. Second operand 9 states. [2019-09-08 12:40:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:13,340 INFO L93 Difference]: Finished difference Result 2781 states and 3707 transitions. [2019-09-08 12:40:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:13,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:13,343 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:40:13,343 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:13,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2063 transitions. [2019-09-08 12:40:13,731 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2063 transitions. Word has length 120 [2019-09-08 12:40:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:13,731 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2063 transitions. [2019-09-08 12:40:13,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2063 transitions. [2019-09-08 12:40:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:13,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:13,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:13,733 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1721896881, now seen corresponding path program 1 times [2019-09-08 12:40:13,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:13,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:13,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:13,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:13,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:13,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:13,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:13,894 INFO L87 Difference]: Start difference. First operand 1572 states and 2063 transitions. Second operand 9 states. [2019-09-08 12:40:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:18,486 INFO L93 Difference]: Finished difference Result 2779 states and 3704 transitions. [2019-09-08 12:40:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:18,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:18,488 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:18,488 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:18,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2062 transitions. [2019-09-08 12:40:18,877 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2062 transitions. Word has length 120 [2019-09-08 12:40:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:18,877 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2062 transitions. [2019-09-08 12:40:18,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2062 transitions. [2019-09-08 12:40:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:18,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:18,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:18,878 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1177456136, now seen corresponding path program 1 times [2019-09-08 12:40:18,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:18,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:19,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:19,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:19,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:19,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:19,049 INFO L87 Difference]: Start difference. First operand 1572 states and 2062 transitions. Second operand 9 states. [2019-09-08 12:40:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:23,233 INFO L93 Difference]: Finished difference Result 2781 states and 3704 transitions. [2019-09-08 12:40:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:23,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:23,237 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:40:23,237 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:23,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2061 transitions. [2019-09-08 12:40:23,662 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2061 transitions. Word has length 120 [2019-09-08 12:40:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:23,662 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2061 transitions. [2019-09-08 12:40:23,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2061 transitions. [2019-09-08 12:40:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:23,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:23,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:23,664 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1777985122, now seen corresponding path program 1 times [2019-09-08 12:40:23,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:23,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:23,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:23,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:23,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:23,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:23,831 INFO L87 Difference]: Start difference. First operand 1572 states and 2061 transitions. Second operand 9 states. [2019-09-08 12:40:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:28,026 INFO L93 Difference]: Finished difference Result 2779 states and 3700 transitions. [2019-09-08 12:40:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:28,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:28,030 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:28,030 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:28,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:28,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2060 transitions. [2019-09-08 12:40:28,429 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2060 transitions. Word has length 120 [2019-09-08 12:40:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:28,429 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2060 transitions. [2019-09-08 12:40:28,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2060 transitions. [2019-09-08 12:40:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:28,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:28,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:28,431 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1420258030, now seen corresponding path program 1 times [2019-09-08 12:40:28,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:28,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:28,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:28,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:28,639 INFO L87 Difference]: Start difference. First operand 1572 states and 2060 transitions. Second operand 9 states. [2019-09-08 12:40:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:33,034 INFO L93 Difference]: Finished difference Result 2873 states and 3845 transitions. [2019-09-08 12:40:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:33,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:33,037 INFO L225 Difference]: With dead ends: 2873 [2019-09-08 12:40:33,037 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:40:33,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:40:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:40:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2059 transitions. [2019-09-08 12:40:33,430 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2059 transitions. Word has length 120 [2019-09-08 12:40:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:33,431 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2059 transitions. [2019-09-08 12:40:33,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2059 transitions. [2019-09-08 12:40:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:33,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:33,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:33,432 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1683439622, now seen corresponding path program 1 times [2019-09-08 12:40:33,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:33,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:33,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:33,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:33,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:33,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:33,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:33,593 INFO L87 Difference]: Start difference. First operand 1572 states and 2059 transitions. Second operand 9 states. [2019-09-08 12:40:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:38,078 INFO L93 Difference]: Finished difference Result 2779 states and 3698 transitions. [2019-09-08 12:40:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:38,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:38,081 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:38,081 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:38,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2058 transitions. [2019-09-08 12:40:38,499 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2058 transitions. Word has length 120 [2019-09-08 12:40:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:38,499 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2058 transitions. [2019-09-08 12:40:38,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2058 transitions. [2019-09-08 12:40:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:38,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:38,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:38,500 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1406863947, now seen corresponding path program 1 times [2019-09-08 12:40:38,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:38,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:38,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:38,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:38,663 INFO L87 Difference]: Start difference. First operand 1572 states and 2058 transitions. Second operand 9 states. [2019-09-08 12:40:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:43,328 INFO L93 Difference]: Finished difference Result 2779 states and 3696 transitions. [2019-09-08 12:40:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:43,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:43,330 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:43,331 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:43,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2057 transitions. [2019-09-08 12:40:43,762 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2057 transitions. Word has length 120 [2019-09-08 12:40:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:43,762 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2057 transitions. [2019-09-08 12:40:43,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2057 transitions. [2019-09-08 12:40:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:43,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:43,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:43,763 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2144453372, now seen corresponding path program 1 times [2019-09-08 12:40:43,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:43,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:43,919 INFO L87 Difference]: Start difference. First operand 1572 states and 2057 transitions. Second operand 9 states. [2019-09-08 12:40:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:48,546 INFO L93 Difference]: Finished difference Result 2875 states and 3843 transitions. [2019-09-08 12:40:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:48,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:48,549 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 12:40:48,549 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 12:40:48,550 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 12:40:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 12:40:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-08 12:40:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2056 transitions. [2019-09-08 12:40:48,976 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2056 transitions. Word has length 120 [2019-09-08 12:40:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:48,976 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2056 transitions. [2019-09-08 12:40:48,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2056 transitions. [2019-09-08 12:40:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:40:48,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:48,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:48,978 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1350775706, now seen corresponding path program 1 times [2019-09-08 12:40:48,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:48,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:49,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:49,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:49,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:49,137 INFO L87 Difference]: Start difference. First operand 1572 states and 2056 transitions. Second operand 9 states. [2019-09-08 12:40:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:53,667 INFO L93 Difference]: Finished difference Result 2779 states and 3693 transitions. [2019-09-08 12:40:53,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:53,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:40:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:53,671 INFO L225 Difference]: With dead ends: 2779 [2019-09-08 12:40:53,671 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:53,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2055 transitions. [2019-09-08 12:40:54,148 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2055 transitions. Word has length 120 [2019-09-08 12:40:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:54,148 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2055 transitions. [2019-09-08 12:40:54,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2055 transitions. [2019-09-08 12:40:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:54,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:54,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:54,150 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 780681115, now seen corresponding path program 1 times [2019-09-08 12:40:54,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:54,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:54,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:54,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:54,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:54,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:54,314 INFO L87 Difference]: Start difference. First operand 1572 states and 2055 transitions. Second operand 9 states. [2019-09-08 12:40:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:58,520 INFO L93 Difference]: Finished difference Result 2781 states and 3694 transitions. [2019-09-08 12:40:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:58,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:40:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:58,524 INFO L225 Difference]: With dead ends: 2781 [2019-09-08 12:40:58,524 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:40:58,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:40:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:40:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:40:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2053 transitions. [2019-09-08 12:40:58,954 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2053 transitions. Word has length 121 [2019-09-08 12:40:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:58,955 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2053 transitions. [2019-09-08 12:40:58,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2053 transitions. [2019-09-08 12:40:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:40:58,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:58,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:58,956 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1446425802, now seen corresponding path program 1 times [2019-09-08 12:40:58,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:58,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:59,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:59,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:59,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:59,117 INFO L87 Difference]: Start difference. First operand 1572 states and 2053 transitions. Second operand 9 states. [2019-09-08 12:41:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:03,370 INFO L93 Difference]: Finished difference Result 2780 states and 3691 transitions. [2019-09-08 12:41:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:03,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:03,373 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 12:41:03,374 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:41:03,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:41:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:41:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:41:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2052 transitions. [2019-09-08 12:41:03,808 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2052 transitions. Word has length 121 [2019-09-08 12:41:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:03,808 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2052 transitions. [2019-09-08 12:41:03,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2052 transitions. [2019-09-08 12:41:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:03,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:03,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:03,810 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1590323129, now seen corresponding path program 1 times [2019-09-08 12:41:03,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:03,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:03,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:03,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:03,971 INFO L87 Difference]: Start difference. First operand 1572 states and 2052 transitions. Second operand 9 states. [2019-09-08 12:41:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:08,424 INFO L93 Difference]: Finished difference Result 2780 states and 3690 transitions. [2019-09-08 12:41:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:08,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:08,427 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 12:41:08,428 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:41:08,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:41:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:41:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:41:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2051 transitions. [2019-09-08 12:41:08,865 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2051 transitions. Word has length 121 [2019-09-08 12:41:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:08,865 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2051 transitions. [2019-09-08 12:41:08,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2051 transitions. [2019-09-08 12:41:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:08,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:08,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:08,866 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:08,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1512469138, now seen corresponding path program 1 times [2019-09-08 12:41:08,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:08,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:09,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:09,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:09,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:09,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:09,024 INFO L87 Difference]: Start difference. First operand 1572 states and 2051 transitions. Second operand 9 states. [2019-09-08 12:41:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:13,436 INFO L93 Difference]: Finished difference Result 2780 states and 3689 transitions. [2019-09-08 12:41:13,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:13,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:13,439 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 12:41:13,439 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:41:13,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:41:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:41:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:41:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2050 transitions. [2019-09-08 12:41:13,865 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2050 transitions. Word has length 121 [2019-09-08 12:41:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:13,865 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2050 transitions. [2019-09-08 12:41:13,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2050 transitions. [2019-09-08 12:41:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:41:13,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:13,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:13,866 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 202339011, now seen corresponding path program 1 times [2019-09-08 12:41:13,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:13,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:14,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:14,032 INFO L87 Difference]: Start difference. First operand 1572 states and 2050 transitions. Second operand 9 states. [2019-09-08 12:41:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:18,297 INFO L93 Difference]: Finished difference Result 2780 states and 3688 transitions. [2019-09-08 12:41:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:18,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:41:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:18,300 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 12:41:18,300 INFO L226 Difference]: Without dead ends: 2609 [2019-09-08 12:41:18,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-08 12:41:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-08 12:41:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:41:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2049 transitions. [2019-09-08 12:41:18,730 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2049 transitions. Word has length 121 [2019-09-08 12:41:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:18,730 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2049 transitions. [2019-09-08 12:41:18,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2049 transitions. [2019-09-08 12:41:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:18,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:18,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:18,732 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -76336468, now seen corresponding path program 1 times [2019-09-08 12:41:18,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:18,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:20,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:20,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:41:20,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:41:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:41:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:20,326 INFO L87 Difference]: Start difference. First operand 1572 states and 2049 transitions. Second operand 21 states. [2019-09-08 12:41:21,289 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-08 12:41:21,523 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-08 12:41:21,853 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-08 12:41:22,081 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-08 12:41:22,289 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-08 12:41:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:32,981 INFO L93 Difference]: Finished difference Result 2303 states and 3004 transitions. [2019-09-08 12:41:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:41:32,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-08 12:41:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:32,984 INFO L225 Difference]: With dead ends: 2303 [2019-09-08 12:41:32,984 INFO L226 Difference]: Without dead ends: 2129 [2019-09-08 12:41:32,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:41:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-09-08 12:41:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1600. [2019-09-08 12:41:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-09-08 12:41:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2087 transitions. [2019-09-08 12:41:33,432 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2087 transitions. Word has length 122 [2019-09-08 12:41:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:33,432 INFO L475 AbstractCegarLoop]: Abstraction has 1600 states and 2087 transitions. [2019-09-08 12:41:33,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:41:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2087 transitions. [2019-09-08 12:41:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:33,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:33,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:33,433 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1490416469, now seen corresponding path program 1 times [2019-09-08 12:41:33,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:33,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:41:34,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:41:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:41:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:34,875 INFO L87 Difference]: Start difference. First operand 1600 states and 2087 transitions. Second operand 22 states. [2019-09-08 12:41:35,962 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-08 12:41:36,232 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 12:41:36,559 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 12:41:36,728 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:41:37,442 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:41:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:43,791 INFO L93 Difference]: Finished difference Result 3444 states and 4555 transitions. [2019-09-08 12:41:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:41:43,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:41:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:43,794 INFO L225 Difference]: With dead ends: 3444 [2019-09-08 12:41:43,794 INFO L226 Difference]: Without dead ends: 3158 [2019-09-08 12:41:43,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:41:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2019-09-08 12:41:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 1618. [2019-09-08 12:41:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-08 12:41:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2105 transitions. [2019-09-08 12:41:44,270 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2105 transitions. Word has length 122 [2019-09-08 12:41:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:44,270 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2105 transitions. [2019-09-08 12:41:44,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:41:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2105 transitions. [2019-09-08 12:41:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:44,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:44,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:44,272 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash 484088792, now seen corresponding path program 1 times [2019-09-08 12:41:44,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:44,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:44,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:44,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:45,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:45,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:41:45,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:41:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:41:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:41:45,083 INFO L87 Difference]: Start difference. First operand 1618 states and 2105 transitions. Second operand 17 states. [2019-09-08 12:41:45,786 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:41:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:52,291 INFO L93 Difference]: Finished difference Result 3208 states and 4264 transitions. [2019-09-08 12:41:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:41:52,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:41:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:52,294 INFO L225 Difference]: With dead ends: 3208 [2019-09-08 12:41:52,294 INFO L226 Difference]: Without dead ends: 3008 [2019-09-08 12:41:52,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:41:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-09-08 12:41:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1606. [2019-09-08 12:41:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-09-08 12:41:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2083 transitions. [2019-09-08 12:41:52,798 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2083 transitions. Word has length 122 [2019-09-08 12:41:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:52,799 INFO L475 AbstractCegarLoop]: Abstraction has 1606 states and 2083 transitions. [2019-09-08 12:41:52,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:41:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2083 transitions. [2019-09-08 12:41:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:41:52,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:52,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:52,800 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -982869291, now seen corresponding path program 1 times [2019-09-08 12:41:52,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:52,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:41:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:41:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:41:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:54,146 INFO L87 Difference]: Start difference. First operand 1606 states and 2083 transitions. Second operand 22 states. [2019-09-08 12:41:55,247 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 12:41:55,526 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:41:55,840 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-08 12:41:55,999 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 12:41:56,415 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 12:41:56,850 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:41:57,164 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:41:57,511 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:41:58,356 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 12:42:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:05,723 INFO L93 Difference]: Finished difference Result 3212 states and 4239 transitions. [2019-09-08 12:42:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:42:05,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:42:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:05,726 INFO L225 Difference]: With dead ends: 3212 [2019-09-08 12:42:05,726 INFO L226 Difference]: Without dead ends: 3004 [2019-09-08 12:42:05,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:42:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2019-09-08 12:42:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1618. [2019-09-08 12:42:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-08 12:42:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2095 transitions. [2019-09-08 12:42:06,285 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2095 transitions. Word has length 122 [2019-09-08 12:42:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:06,285 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2095 transitions. [2019-09-08 12:42:06,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:42:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2095 transitions. [2019-09-08 12:42:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:06,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:06,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:06,287 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1606641247, now seen corresponding path program 1 times [2019-09-08 12:42:06,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:07,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:07,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:42:07,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:42:07,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:42:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:42:07,118 INFO L87 Difference]: Start difference. First operand 1618 states and 2095 transitions. Second operand 17 states. [2019-09-08 12:42:07,763 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:42:07,916 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:42:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:12,170 INFO L93 Difference]: Finished difference Result 3256 states and 4324 transitions. [2019-09-08 12:42:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:42:12,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:42:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:12,173 INFO L225 Difference]: With dead ends: 3256 [2019-09-08 12:42:12,173 INFO L226 Difference]: Without dead ends: 2982 [2019-09-08 12:42:12,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:42:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2019-09-08 12:42:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1572. [2019-09-08 12:42:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:42:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2032 transitions. [2019-09-08 12:42:12,697 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2032 transitions. Word has length 122 [2019-09-08 12:42:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:12,697 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2032 transitions. [2019-09-08 12:42:12,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:42:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2032 transitions. [2019-09-08 12:42:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:12,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:12,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:12,698 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -185074006, now seen corresponding path program 1 times [2019-09-08 12:42:12,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:13,697 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:42:13,852 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:42:14,005 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 12:42:14,176 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 12:42:14,364 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 12:42:14,565 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 12:42:14,770 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-08 12:42:14,957 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:42:15,141 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:42:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:17,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:17,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:42:17,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:42:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:42:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:42:17,026 INFO L87 Difference]: Start difference. First operand 1572 states and 2032 transitions. Second operand 36 states. [2019-09-08 12:42:17,322 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-08 12:42:18,563 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2019-09-08 12:42:18,793 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-09-08 12:42:19,043 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-08 12:42:19,301 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-09-08 12:42:20,192 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-08 12:42:20,664 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 79 [2019-09-08 12:42:21,217 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 95 [2019-09-08 12:42:21,919 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 110 [2019-09-08 12:42:22,675 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2019-09-08 12:42:23,615 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 144 [2019-09-08 12:42:24,068 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2019-09-08 12:42:24,500 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2019-09-08 12:42:24,728 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 12:42:25,193 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 12:42:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:56,559 INFO L93 Difference]: Finished difference Result 2516 states and 3292 transitions. [2019-09-08 12:42:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:42:56,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-08 12:42:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:56,561 INFO L225 Difference]: With dead ends: 2516 [2019-09-08 12:42:56,562 INFO L226 Difference]: Without dead ends: 2342 [2019-09-08 12:42:56,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=558, Invalid=3224, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 12:42:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2019-09-08 12:42:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1592. [2019-09-08 12:42:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-09-08 12:42:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2059 transitions. [2019-09-08 12:42:57,125 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2059 transitions. Word has length 122 [2019-09-08 12:42:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:57,125 INFO L475 AbstractCegarLoop]: Abstraction has 1592 states and 2059 transitions. [2019-09-08 12:42:57,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:42:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2059 transitions. [2019-09-08 12:42:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:42:57,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:57,127 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:57,127 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1305180917, now seen corresponding path program 1 times [2019-09-08 12:42:57,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:57,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:58,310 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:42:58,501 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:42:58,696 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:42:59,058 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:42:59,234 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:43:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:01,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:01,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:43:01,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:43:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:43:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:43:01,026 INFO L87 Difference]: Start difference. First operand 1592 states and 2059 transitions. Second operand 36 states. [2019-09-08 12:43:01,286 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:43:02,308 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-08 12:43:02,494 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:43:02,715 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:43:02,942 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:43:03,601 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:43:04,085 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-09-08 12:43:04,657 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-09-08 12:43:05,423 WARN L188 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 142 [2019-09-08 12:43:08,445 WARN L188 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 182 DAG size of output: 162 [2019-09-08 12:43:10,276 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 207 DAG size of output: 185 [2019-09-08 12:43:10,644 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-08 12:43:10,978 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-08 12:43:11,416 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-08 12:43:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:47,023 INFO L93 Difference]: Finished difference Result 3957 states and 5224 transitions. [2019-09-08 12:43:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 12:43:47,023 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-08 12:43:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:47,027 INFO L225 Difference]: With dead ends: 3957 [2019-09-08 12:43:47,027 INFO L226 Difference]: Without dead ends: 3780 [2019-09-08 12:43:47,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=726, Invalid=3966, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 12:43:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-09-08 12:43:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 1601. [2019-09-08 12:43:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-09-08 12:43:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2071 transitions. [2019-09-08 12:43:47,605 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2071 transitions. Word has length 122 [2019-09-08 12:43:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:47,605 INFO L475 AbstractCegarLoop]: Abstraction has 1601 states and 2071 transitions. [2019-09-08 12:43:47,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:43:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2071 transitions. [2019-09-08 12:43:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:43:47,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:47,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:47,607 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash -261572020, now seen corresponding path program 1 times [2019-09-08 12:43:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:47,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:47,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:47,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:48,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:48,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:43:48,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:43:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:43:48,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:43:48,385 INFO L87 Difference]: Start difference. First operand 1601 states and 2071 transitions. Second operand 17 states. [2019-09-08 12:43:49,045 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:43:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:55,640 INFO L93 Difference]: Finished difference Result 3101 states and 4114 transitions. [2019-09-08 12:43:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:43:55,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:43:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:55,643 INFO L225 Difference]: With dead ends: 3101 [2019-09-08 12:43:55,643 INFO L226 Difference]: Without dead ends: 2881 [2019-09-08 12:43:55,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:43:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-09-08 12:43:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2019-09-08 12:43:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-08 12:43:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2030 transitions. [2019-09-08 12:43:56,224 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2030 transitions. Word has length 122 [2019-09-08 12:43:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:56,224 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2030 transitions. [2019-09-08 12:43:56,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:43:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2030 transitions. [2019-09-08 12:43:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:43:56,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:56,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:56,226 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash -364307142, now seen corresponding path program 1 times [2019-09-08 12:43:56,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:57,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:43:57,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:43:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:43:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:43:57,035 INFO L87 Difference]: Start difference. First operand 1572 states and 2030 transitions. Second operand 17 states. [2019-09-08 12:43:57,722 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:44:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:01,636 INFO L93 Difference]: Finished difference Result 3272 states and 4329 transitions. [2019-09-08 12:44:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:44:01,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:44:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:01,639 INFO L225 Difference]: With dead ends: 3272 [2019-09-08 12:44:01,639 INFO L226 Difference]: Without dead ends: 2922 [2019-09-08 12:44:01,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:44:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-09-08 12:44:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1488. [2019-09-08 12:44:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-09-08 12:44:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1912 transitions. [2019-09-08 12:44:02,234 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1912 transitions. Word has length 122 [2019-09-08 12:44:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:02,235 INFO L475 AbstractCegarLoop]: Abstraction has 1488 states and 1912 transitions. [2019-09-08 12:44:02,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:44:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1912 transitions. [2019-09-08 12:44:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:02,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:02,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:02,237 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199447, now seen corresponding path program 1 times [2019-09-08 12:44:02,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:03,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:44:03,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:44:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:44:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:44:03,019 INFO L87 Difference]: Start difference. First operand 1488 states and 1912 transitions. Second operand 17 states. [2019-09-08 12:44:03,670 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:44:03,822 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:44:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:06,150 INFO L93 Difference]: Finished difference Result 2344 states and 3092 transitions. [2019-09-08 12:44:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:44:06,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:44:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:06,153 INFO L225 Difference]: With dead ends: 2344 [2019-09-08 12:44:06,153 INFO L226 Difference]: Without dead ends: 1866 [2019-09-08 12:44:06,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:44:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-09-08 12:44:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1384. [2019-09-08 12:44:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-09-08 12:44:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1777 transitions. [2019-09-08 12:44:06,693 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1777 transitions. Word has length 122 [2019-09-08 12:44:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:06,694 INFO L475 AbstractCegarLoop]: Abstraction has 1384 states and 1777 transitions. [2019-09-08 12:44:06,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:44:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1777 transitions. [2019-09-08 12:44:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:06,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:06,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:06,697 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1521800364, now seen corresponding path program 1 times [2019-09-08 12:44:06,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:07,614 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:44:07,805 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:44:07,985 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:44:08,166 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 12:44:08,375 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 12:44:08,568 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 12:44:08,737 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:44:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:10,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:10,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-08 12:44:10,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 12:44:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 12:44:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:44:10,110 INFO L87 Difference]: Start difference. First operand 1384 states and 1777 transitions. Second operand 35 states. [2019-09-08 12:44:10,349 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-08 12:44:11,689 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-08 12:44:11,892 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:44:12,120 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-08 12:44:12,492 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-08 12:44:13,200 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-09-08 12:44:13,637 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 84 [2019-09-08 12:44:14,174 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2019-09-08 12:44:14,785 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 109 [2019-09-08 12:44:15,471 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 123 [2019-09-08 12:44:15,829 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-09-08 12:44:16,171 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-08 12:44:16,542 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-09-08 12:44:16,837 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-08 12:44:17,164 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-08 12:44:17,678 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-08 12:44:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:40,363 INFO L93 Difference]: Finished difference Result 2272 states and 2996 transitions. [2019-09-08 12:44:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 12:44:40,363 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-09-08 12:44:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:40,365 INFO L225 Difference]: With dead ends: 2272 [2019-09-08 12:44:40,365 INFO L226 Difference]: Without dead ends: 2073 [2019-09-08 12:44:40,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 12:44:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-09-08 12:44:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1405. [2019-09-08 12:44:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-08 12:44:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1801 transitions. [2019-09-08 12:44:40,954 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1801 transitions. Word has length 122 [2019-09-08 12:44:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,954 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1801 transitions. [2019-09-08 12:44:40,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 12:44:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1801 transitions. [2019-09-08 12:44:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:40,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:40,956 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -784730414, now seen corresponding path program 1 times [2019-09-08 12:44:40,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:44:41,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:44:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:44:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:44:41,761 INFO L87 Difference]: Start difference. First operand 1405 states and 1801 transitions. Second operand 17 states. [2019-09-08 12:44:42,492 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:44:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:50,416 INFO L93 Difference]: Finished difference Result 2694 states and 3561 transitions. [2019-09-08 12:44:50,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:44:50,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:44:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:50,419 INFO L225 Difference]: With dead ends: 2694 [2019-09-08 12:44:50,419 INFO L226 Difference]: Without dead ends: 2521 [2019-09-08 12:44:50,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:44:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2019-09-08 12:44:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 1405. [2019-09-08 12:44:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-08 12:44:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1799 transitions. [2019-09-08 12:44:51,025 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1799 transitions. Word has length 122 [2019-09-08 12:44:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:51,025 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1799 transitions. [2019-09-08 12:44:51,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:44:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1799 transitions. [2019-09-08 12:44:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:44:51,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:51,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:51,027 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash -442149559, now seen corresponding path program 1 times [2019-09-08 12:44:51,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:51,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:52,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:44:52,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:44:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:44:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:52,378 INFO L87 Difference]: Start difference. First operand 1405 states and 1799 transitions. Second operand 22 states. [2019-09-08 12:44:53,576 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 12:44:53,858 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-08 12:44:54,284 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 12:44:54,463 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:44:55,529 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 12:44:56,383 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 12:44:56,803 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:44:57,270 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:45:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:09,523 INFO L93 Difference]: Finished difference Result 3303 states and 4345 transitions. [2019-09-08 12:45:09,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:45:09,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:45:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:09,526 INFO L225 Difference]: With dead ends: 3303 [2019-09-08 12:45:09,526 INFO L226 Difference]: Without dead ends: 3126 [2019-09-08 12:45:09,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:45:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2019-09-08 12:45:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1411. [2019-09-08 12:45:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-08 12:45:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1805 transitions. [2019-09-08 12:45:10,142 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1805 transitions. Word has length 122 [2019-09-08 12:45:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:10,142 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1805 transitions. [2019-09-08 12:45:10,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:45:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1805 transitions. [2019-09-08 12:45:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:45:10,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:10,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:10,143 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2080949619, now seen corresponding path program 1 times [2019-09-08 12:45:10,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:10,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:10,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:10,849 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:45:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:11,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:11,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:45:11,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:45:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:45:11,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:45:11,494 INFO L87 Difference]: Start difference. First operand 1411 states and 1805 transitions. Second operand 20 states. [2019-09-08 12:45:12,414 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-08 12:45:12,622 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-08 12:45:12,787 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:45:12,945 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:45:13,109 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:45:13,238 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:45:13,386 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:45:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:18,392 INFO L93 Difference]: Finished difference Result 2272 states and 2959 transitions. [2019-09-08 12:45:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:45:18,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2019-09-08 12:45:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:18,395 INFO L225 Difference]: With dead ends: 2272 [2019-09-08 12:45:18,395 INFO L226 Difference]: Without dead ends: 1868 [2019-09-08 12:45:18,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:45:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2019-09-08 12:45:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1396. [2019-09-08 12:45:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-09-08 12:45:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1787 transitions. [2019-09-08 12:45:18,988 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1787 transitions. Word has length 122 [2019-09-08 12:45:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:18,988 INFO L475 AbstractCegarLoop]: Abstraction has 1396 states and 1787 transitions. [2019-09-08 12:45:18,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:45:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1787 transitions. [2019-09-08 12:45:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:45:18,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:18,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:18,989 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash -918579394, now seen corresponding path program 1 times [2019-09-08 12:45:18,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:18,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:18,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:20,050 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:45:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:20,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:20,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:45:20,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:45:20,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:45:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:20,827 INFO L87 Difference]: Start difference. First operand 1396 states and 1787 transitions. Second operand 22 states.