java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:43:31,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:43:31,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:43:31,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:43:31,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:43:31,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:43:31,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:43:31,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:43:31,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:43:31,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:43:31,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:43:31,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:43:31,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:43:31,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:43:31,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:43:31,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:43:31,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:43:31,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:43:31,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:43:31,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:43:31,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:43:31,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:43:31,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:43:31,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:43:31,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:43:31,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:43:31,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:43:31,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:43:31,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:43:31,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:43:31,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:43:31,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:43:31,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:43:31,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:43:31,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:43:31,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:43:31,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:43:31,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:43:31,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:43:31,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:43:31,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:43:31,933 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-10-14 23:43:31,951 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:43:31,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:43:31,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:43:31,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:43:31,953 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:43:31,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:43:31,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:43:31,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:43:31,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:43:31,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:43:31,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:43:31,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:43:31,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:43:31,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:43:31,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:43:31,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:43:31,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:43:31,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:43:31,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:43:31,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:43:31,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:43:31,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:43:31,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:43:31,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:43:31,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:43:31,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:43:31,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:43:31,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:43:31,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:43:32,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:43:32,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:43:32,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:43:32,289 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:43:32,289 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:43:32,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:43:32,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eabed2b0/b44a0d88d29a4263ba9f1578b323f39e/FLAGb3d355231 [2019-10-14 23:43:32,943 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:43:32,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:43:32,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eabed2b0/b44a0d88d29a4263ba9f1578b323f39e/FLAGb3d355231 [2019-10-14 23:43:33,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eabed2b0/b44a0d88d29a4263ba9f1578b323f39e [2019-10-14 23:43:33,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:43:33,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:43:33,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:33,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:43:33,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:43:33,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:33" (1/1) ... [2019-10-14 23:43:33,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:33, skipping insertion in model container [2019-10-14 23:43:33,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:33" (1/1) ... [2019-10-14 23:43:33,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:43:33,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:43:33,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:34,010 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:43:34,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:34,355 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:43:34,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34 WrapperNode [2019-10-14 23:43:34,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:34,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:43:34,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:43:34,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:43:34,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (1/1) ... [2019-10-14 23:43:34,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:43:34,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:43:34,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:43:34,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:43:34,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (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-10-14 23:43:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:43:34,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:43:34,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:43:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:43:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:43:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:43:34,519 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:43:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:43:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:43:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:43:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:43:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:43:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:43:35,918 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:43:35,919 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:43:35,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:35 BoogieIcfgContainer [2019-10-14 23:43:35,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:43:35,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:43:35,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:43:35,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:43:35,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:43:33" (1/3) ... [2019-10-14 23:43:35,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661e2233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:35, skipping insertion in model container [2019-10-14 23:43:35,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:34" (2/3) ... [2019-10-14 23:43:35,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661e2233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:35, skipping insertion in model container [2019-10-14 23:43:35,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:35" (3/3) ... [2019-10-14 23:43:35,938 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:43:35,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:43:35,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-14 23:43:35,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-14 23:43:36,004 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:43:36,004 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:43:36,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:43:36,004 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:43:36,005 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:43:36,005 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:43:36,005 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:43:36,005 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:43:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states. [2019-10-14 23:43:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-14 23:43:36,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:36,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:36,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 566032510, now seen corresponding path program 1 times [2019-10-14 23:43:36,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:36,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088315932] [2019-10-14 23:43:36,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:36,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:36,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:37,097 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:37,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088315932] [2019-10-14 23:43:37,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:37,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:37,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880865908] [2019-10-14 23:43:37,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:37,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:37,183 INFO L87 Difference]: Start difference. First operand 376 states. Second operand 4 states. [2019-10-14 23:43:37,547 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-10-14 23:43:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:39,857 INFO L93 Difference]: Finished difference Result 683 states and 1210 transitions. [2019-10-14 23:43:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:43:39,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-14 23:43:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:39,879 INFO L225 Difference]: With dead ends: 683 [2019-10-14 23:43:39,879 INFO L226 Difference]: Without dead ends: 536 [2019-10-14 23:43:39,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-14 23:43:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2019-10-14 23:43:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-14 23:43:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 783 transitions. [2019-10-14 23:43:39,971 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 783 transitions. Word has length 137 [2019-10-14 23:43:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:39,971 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 783 transitions. [2019-10-14 23:43:39,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:43:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 783 transitions. [2019-10-14 23:43:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-14 23:43:39,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:39,977 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:39,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash 227617534, now seen corresponding path program 1 times [2019-10-14 23:43:39,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:39,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103813652] [2019-10-14 23:43:39,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:39,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:40,437 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:40,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103813652] [2019-10-14 23:43:40,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:40,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:40,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469707192] [2019-10-14 23:43:40,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:40,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:40,505 INFO L87 Difference]: Start difference. First operand 534 states and 783 transitions. Second operand 4 states. [2019-10-14 23:43:40,810 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-10-14 23:43:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:42,700 INFO L93 Difference]: Finished difference Result 1069 states and 1620 transitions. [2019-10-14 23:43:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:43:42,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-14 23:43:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:42,718 INFO L225 Difference]: With dead ends: 1069 [2019-10-14 23:43:42,718 INFO L226 Difference]: Without dead ends: 878 [2019-10-14 23:43:42,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-10-14 23:43:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2019-10-14 23:43:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-14 23:43:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1307 transitions. [2019-10-14 23:43:42,777 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1307 transitions. Word has length 137 [2019-10-14 23:43:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:42,778 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1307 transitions. [2019-10-14 23:43:42,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:43:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1307 transitions. [2019-10-14 23:43:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-14 23:43:42,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:42,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:42,783 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash 227278910, now seen corresponding path program 1 times [2019-10-14 23:43:42,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:42,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975044111] [2019-10-14 23:43:42,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:42,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:42,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:43,532 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:43,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975044111] [2019-10-14 23:43:43,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:43,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:43:43,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110409224] [2019-10-14 23:43:43,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:43:43,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:43:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:43,624 INFO L87 Difference]: Start difference. First operand 876 states and 1307 transitions. Second operand 5 states. [2019-10-14 23:43:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:46,547 INFO L93 Difference]: Finished difference Result 2559 states and 3814 transitions. [2019-10-14 23:43:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:43:46,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-14 23:43:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:46,560 INFO L225 Difference]: With dead ends: 2559 [2019-10-14 23:43:46,560 INFO L226 Difference]: Without dead ends: 1696 [2019-10-14 23:43:46,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:43:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-10-14 23:43:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1660. [2019-10-14 23:43:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-10-14 23:43:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2465 transitions. [2019-10-14 23:43:46,659 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2465 transitions. Word has length 137 [2019-10-14 23:43:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:46,660 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 2465 transitions. [2019-10-14 23:43:46,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:43:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2465 transitions. [2019-10-14 23:43:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-14 23:43:46,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:46,665 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:46,665 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1550747192, now seen corresponding path program 1 times [2019-10-14 23:43:46,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:46,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348040437] [2019-10-14 23:43:46,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:46,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:46,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:47,175 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:47,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348040437] [2019-10-14 23:43:47,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:47,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:47,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866294054] [2019-10-14 23:43:47,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:47,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:47,211 INFO L87 Difference]: Start difference. First operand 1660 states and 2465 transitions. Second operand 4 states. [2019-10-14 23:43:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:48,958 INFO L93 Difference]: Finished difference Result 4934 states and 7325 transitions. [2019-10-14 23:43:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:43:48,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-14 23:43:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:48,975 INFO L225 Difference]: With dead ends: 4934 [2019-10-14 23:43:48,975 INFO L226 Difference]: Without dead ends: 3306 [2019-10-14 23:43:48,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2019-10-14 23:43:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 1662. [2019-10-14 23:43:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-10-14 23:43:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2467 transitions. [2019-10-14 23:43:49,072 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2467 transitions. Word has length 138 [2019-10-14 23:43:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:49,073 INFO L462 AbstractCegarLoop]: Abstraction has 1662 states and 2467 transitions. [2019-10-14 23:43:49,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:43:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2467 transitions. [2019-10-14 23:43:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-14 23:43:49,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:49,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:49,077 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179683, now seen corresponding path program 1 times [2019-10-14 23:43:49,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:49,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395913376] [2019-10-14 23:43:49,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:49,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:49,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:49,540 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:49,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395913376] [2019-10-14 23:43:49,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:49,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:43:49,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091515554] [2019-10-14 23:43:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:43:49,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:43:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:49,593 INFO L87 Difference]: Start difference. First operand 1662 states and 2467 transitions. Second operand 5 states. [2019-10-14 23:43:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:52,212 INFO L93 Difference]: Finished difference Result 4830 states and 7153 transitions. [2019-10-14 23:43:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:43:52,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-14 23:43:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:52,229 INFO L225 Difference]: With dead ends: 4830 [2019-10-14 23:43:52,229 INFO L226 Difference]: Without dead ends: 3202 [2019-10-14 23:43:52,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:43:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2019-10-14 23:43:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3166. [2019-10-14 23:43:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-10-14 23:43:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 4659 transitions. [2019-10-14 23:43:52,423 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 4659 transitions. Word has length 139 [2019-10-14 23:43:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:52,423 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 4659 transitions. [2019-10-14 23:43:52,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:43:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 4659 transitions. [2019-10-14 23:43:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-14 23:43:52,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:52,431 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:52,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1901470855, now seen corresponding path program 1 times [2019-10-14 23:43:52,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:52,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058262064] [2019-10-14 23:43:52,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:52,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:52,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:52,757 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:52,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058262064] [2019-10-14 23:43:52,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:52,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:52,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427526552] [2019-10-14 23:43:52,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:52,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:52,794 INFO L87 Difference]: Start difference. First operand 3166 states and 4659 transitions. Second operand 4 states. [2019-10-14 23:43:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:55,598 INFO L93 Difference]: Finished difference Result 9414 states and 13849 transitions. [2019-10-14 23:43:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:43:55,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-14 23:43:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:55,626 INFO L225 Difference]: With dead ends: 9414 [2019-10-14 23:43:55,627 INFO L226 Difference]: Without dead ends: 6296 [2019-10-14 23:43:55,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-10-14 23:43:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 3170. [2019-10-14 23:43:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2019-10-14 23:43:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4663 transitions. [2019-10-14 23:43:55,793 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4663 transitions. Word has length 140 [2019-10-14 23:43:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:55,794 INFO L462 AbstractCegarLoop]: Abstraction has 3170 states and 4663 transitions. [2019-10-14 23:43:55,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:43:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4663 transitions. [2019-10-14 23:43:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:43:55,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:55,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:55,800 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233700, now seen corresponding path program 1 times [2019-10-14 23:43:55,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:55,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288897467] [2019-10-14 23:43:55,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:55,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:56,172 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:56,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288897467] [2019-10-14 23:43:56,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:56,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:56,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254405418] [2019-10-14 23:43:56,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:56,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:56,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:56,214 INFO L87 Difference]: Start difference. First operand 3170 states and 4663 transitions. Second operand 4 states. [2019-10-14 23:43:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:58,570 INFO L93 Difference]: Finished difference Result 8343 states and 12276 transitions. [2019-10-14 23:43:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:43:58,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-14 23:43:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:58,593 INFO L225 Difference]: With dead ends: 8343 [2019-10-14 23:43:58,593 INFO L226 Difference]: Without dead ends: 5461 [2019-10-14 23:43:58,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-10-14 23:43:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5425. [2019-10-14 23:43:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-10-14 23:43:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7876 transitions. [2019-10-14 23:43:58,866 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7876 transitions. Word has length 141 [2019-10-14 23:43:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:58,866 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7876 transitions. [2019-10-14 23:43:58,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:43:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7876 transitions. [2019-10-14 23:43:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:43:58,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:58,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:58,877 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1702008345, now seen corresponding path program 1 times [2019-10-14 23:43:58,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:58,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109383925] [2019-10-14 23:43:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:58,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:59,309 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:43:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:59,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109383925] [2019-10-14 23:43:59,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:59,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:43:59,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216435141] [2019-10-14 23:43:59,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:43:59,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:43:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:59,353 INFO L87 Difference]: Start difference. First operand 5425 states and 7876 transitions. Second operand 5 states. [2019-10-14 23:44:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:01,259 INFO L93 Difference]: Finished difference Result 11218 states and 16169 transitions. [2019-10-14 23:44:01,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:01,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-14 23:44:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:01,282 INFO L225 Difference]: With dead ends: 11218 [2019-10-14 23:44:01,282 INFO L226 Difference]: Without dead ends: 5673 [2019-10-14 23:44:01,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-10-14 23:44:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5637. [2019-10-14 23:44:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5637 states. [2019-10-14 23:44:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8064 transitions. [2019-10-14 23:44:01,548 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8064 transitions. Word has length 141 [2019-10-14 23:44:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:01,548 INFO L462 AbstractCegarLoop]: Abstraction has 5637 states and 8064 transitions. [2019-10-14 23:44:01,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8064 transitions. [2019-10-14 23:44:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:44:01,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:01,562 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:01,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:01,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:01,563 INFO L82 PathProgramCache]: Analyzing trace with hash 680281852, now seen corresponding path program 1 times [2019-10-14 23:44:01,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:01,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786832996] [2019-10-14 23:44:01,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:02,025 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:44:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:02,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786832996] [2019-10-14 23:44:02,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:02,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:02,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947293026] [2019-10-14 23:44:02,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:02,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:02,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:02,073 INFO L87 Difference]: Start difference. First operand 5637 states and 8064 transitions. Second operand 5 states. [2019-10-14 23:44:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:04,602 INFO L93 Difference]: Finished difference Result 7924 states and 11307 transitions. [2019-10-14 23:44:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:04,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-14 23:44:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:04,613 INFO L225 Difference]: With dead ends: 7924 [2019-10-14 23:44:04,614 INFO L226 Difference]: Without dead ends: 5673 [2019-10-14 23:44:04,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-10-14 23:44:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5425. [2019-10-14 23:44:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-10-14 23:44:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 7802 transitions. [2019-10-14 23:44:04,850 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 7802 transitions. Word has length 141 [2019-10-14 23:44:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:04,850 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 7802 transitions. [2019-10-14 23:44:04,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 7802 transitions. [2019-10-14 23:44:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-14 23:44:04,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:04,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:04,860 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash -341992133, now seen corresponding path program 1 times [2019-10-14 23:44:04,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:04,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856030583] [2019-10-14 23:44:04,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:04,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:05,204 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:44:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:05,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-10-14 23:44:05,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856030583] [2019-10-14 23:44:05,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:05,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:05,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288929654] [2019-10-14 23:44:05,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:05,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:05,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:05,246 INFO L87 Difference]: Start difference. First operand 5425 states and 7802 transitions. Second operand 4 states. [2019-10-14 23:44:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:07,135 INFO L93 Difference]: Finished difference Result 12993 states and 18652 transitions. [2019-10-14 23:44:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:07,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-14 23:44:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:07,158 INFO L225 Difference]: With dead ends: 12993 [2019-10-14 23:44:07,158 INFO L226 Difference]: Without dead ends: 10742 [2019-10-14 23:44:07,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10742 states. [2019-10-14 23:44:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10742 to 5433. [2019-10-14 23:44:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-10-14 23:44:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7810 transitions. [2019-10-14 23:44:07,470 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7810 transitions. Word has length 142 [2019-10-14 23:44:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:07,471 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 7810 transitions. [2019-10-14 23:44:07,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7810 transitions. [2019-10-14 23:44:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-14 23:44:07,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:07,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:07,478 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash -560885818, now seen corresponding path program 1 times [2019-10-14 23:44:07,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:07,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-14 23:44:07,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:07,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:07,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:07,951 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-14 23:44:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:08,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-14 23:44:08,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:08,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:08,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524000701] [2019-10-14 23:44:08,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:08,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:08,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:08,004 INFO L87 Difference]: Start difference. First operand 5433 states and 7810 transitions. Second operand 5 states.