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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:58:10,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:58:10,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:58:10,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:58:10,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:58:10,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:58:10,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:58:10,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:58:10,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:58:10,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:58:10,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:58:10,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:58:10,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:58:10,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:58:10,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:58:10,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:58:10,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:58:10,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:58:10,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:58:10,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:58:10,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:58:10,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:58:10,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:58:10,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:58:10,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:58:10,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:58:10,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:58:10,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:58:10,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:58:10,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:58:10,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:58:10,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:58:10,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:58:10,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:58:10,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:58:10,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:58:10,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:58:10,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:58:10,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:58:10,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:58:10,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:58:10,944 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:58:10,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:58:10,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:58:10,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:58:10,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:58:10,969 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:58:10,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:58:10,970 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:58:10,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:58:10,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:58:10,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:58:10,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:58:10,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:58:10,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:58:10,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:58:10,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:58:10,972 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:58:10,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:58:10,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:58:10,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:58:10,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:58:10,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:58:10,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:58:10,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:58:10,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:58:10,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:58:10,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:58:10,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:58:10,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:58:10,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:58:11,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:58:11,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:58:11,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:58:11,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:58:11,058 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:58:11,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:58:11,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e0b8501/c10d0179590d47949a2c0b276d49511b/FLAGb5a7c9e4b [2019-09-08 12:58:11,738 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:58:11,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:58:11,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e0b8501/c10d0179590d47949a2c0b276d49511b/FLAGb5a7c9e4b [2019-09-08 12:58:11,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e0b8501/c10d0179590d47949a2c0b276d49511b [2019-09-08 12:58:11,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:58:11,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:58:11,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:58:11,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:58:11,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:58:11,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:58:11" (1/1) ... [2019-09-08 12:58:11,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f2ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:11, skipping insertion in model container [2019-09-08 12:58:11,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:58:11" (1/1) ... [2019-09-08 12:58:11,986 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:58:12,069 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:58:12,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:58:12,698 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:58:13,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:58:13,219 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:58:13,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13 WrapperNode [2019-09-08 12:58:13,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:58:13,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:58:13,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:58:13,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:58:13,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (1/1) ... [2019-09-08 12:58:13,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:58:13,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:58:13,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:58:13,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:58:13,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (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:58:13,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:58:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:58:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:58:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:58:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:58:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:58:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:58:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:58:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:58:13,507 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:58:13,508 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:58:13,508 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:58:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:58:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:58:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:58:15,326 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:58:15,326 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:58:15,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:58:15 BoogieIcfgContainer [2019-09-08 12:58:15,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:58:15,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:58:15,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:58:15,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:58:15,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:58:11" (1/3) ... [2019-09-08 12:58:15,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f962a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:58:15, skipping insertion in model container [2019-09-08 12:58:15,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:58:13" (2/3) ... [2019-09-08 12:58:15,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f962a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:58:15, skipping insertion in model container [2019-09-08 12:58:15,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:58:15" (3/3) ... [2019-09-08 12:58:15,340 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:58:15,351 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:58:15,361 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 12:58:15,381 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 12:58:15,419 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:58:15,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:58:15,420 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:58:15,420 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:58:15,420 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:58:15,421 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:58:15,421 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:58:15,421 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:58:15,421 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:58:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-09-08 12:58:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:58:15,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:15,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:15,476 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 598173108, now seen corresponding path program 1 times [2019-09-08 12:58:15,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:15,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:15,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:16,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:16,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:16,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:16,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:16,456 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-09-08 12:58:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:16,691 INFO L93 Difference]: Finished difference Result 1245 states and 2212 transitions. [2019-09-08 12:58:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:58:16,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 12:58:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:16,729 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 12:58:16,729 INFO L226 Difference]: Without dead ends: 821 [2019-09-08 12:58:16,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-08 12:58:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2019-09-08 12:58:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-09-08 12:58:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2019-09-08 12:58:16,897 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 154 [2019-09-08 12:58:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:16,898 INFO L475 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2019-09-08 12:58:16,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2019-09-08 12:58:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:58:16,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:16,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:16,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1172332246, now seen corresponding path program 1 times [2019-09-08 12:58:16,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:16,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:16,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:17,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:17,057 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand 3 states. [2019-09-08 12:58:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:17,124 INFO L93 Difference]: Finished difference Result 2336 states and 3338 transitions. [2019-09-08 12:58:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:17,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:58:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:17,136 INFO L225 Difference]: With dead ends: 2336 [2019-09-08 12:58:17,136 INFO L226 Difference]: Without dead ends: 1574 [2019-09-08 12:58:17,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-09-08 12:58:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 796. [2019-09-08 12:58:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-09-08 12:58:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1138 transitions. [2019-09-08 12:58:17,187 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1138 transitions. Word has length 155 [2019-09-08 12:58:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:17,189 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 1138 transitions. [2019-09-08 12:58:17,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1138 transitions. [2019-09-08 12:58:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:58:17,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:17,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:17,194 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 501625459, now seen corresponding path program 1 times [2019-09-08 12:58:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:17,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:17,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:17,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:17,388 INFO L87 Difference]: Start difference. First operand 796 states and 1138 transitions. Second operand 3 states. [2019-09-08 12:58:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:17,500 INFO L93 Difference]: Finished difference Result 2139 states and 3061 transitions. [2019-09-08 12:58:17,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:17,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 12:58:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:17,512 INFO L225 Difference]: With dead ends: 2139 [2019-09-08 12:58:17,512 INFO L226 Difference]: Without dead ends: 1540 [2019-09-08 12:58:17,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-09-08 12:58:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1513. [2019-09-08 12:58:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-09-08 12:58:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2153 transitions. [2019-09-08 12:58:17,619 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2153 transitions. Word has length 156 [2019-09-08 12:58:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:17,619 INFO L475 AbstractCegarLoop]: Abstraction has 1513 states and 2153 transitions. [2019-09-08 12:58:17,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2153 transitions. [2019-09-08 12:58:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:58:17,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:17,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:17,624 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 104654224, now seen corresponding path program 1 times [2019-09-08 12:58:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:17,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:17,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:17,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:17,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:17,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:17,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:17,802 INFO L87 Difference]: Start difference. First operand 1513 states and 2153 transitions. Second operand 4 states. [2019-09-08 12:58:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:17,899 INFO L93 Difference]: Finished difference Result 2489 states and 3549 transitions. [2019-09-08 12:58:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:17,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 12:58:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:17,909 INFO L225 Difference]: With dead ends: 2489 [2019-09-08 12:58:17,909 INFO L226 Difference]: Without dead ends: 1161 [2019-09-08 12:58:17,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-09-08 12:58:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2019-09-08 12:58:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-09-08 12:58:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1645 transitions. [2019-09-08 12:58:18,009 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1645 transitions. Word has length 156 [2019-09-08 12:58:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:18,010 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1645 transitions. [2019-09-08 12:58:18,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1645 transitions. [2019-09-08 12:58:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:58:18,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:18,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:18,016 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1233167963, now seen corresponding path program 1 times [2019-09-08 12:58:18,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:18,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:18,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:18,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:18,151 INFO L87 Difference]: Start difference. First operand 1161 states and 1645 transitions. Second operand 3 states. [2019-09-08 12:58:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:18,305 INFO L93 Difference]: Finished difference Result 2522 states and 3657 transitions. [2019-09-08 12:58:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:18,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 12:58:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:18,316 INFO L225 Difference]: With dead ends: 2522 [2019-09-08 12:58:18,317 INFO L226 Difference]: Without dead ends: 1547 [2019-09-08 12:58:18,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-09-08 12:58:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1382. [2019-09-08 12:58:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-08 12:58:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2003 transitions. [2019-09-08 12:58:18,465 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2003 transitions. Word has length 158 [2019-09-08 12:58:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:18,466 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2003 transitions. [2019-09-08 12:58:18,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2003 transitions. [2019-09-08 12:58:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:58:18,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:18,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:18,470 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash -866694497, now seen corresponding path program 1 times [2019-09-08 12:58:18,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:18,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:18,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:18,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:18,596 INFO L87 Difference]: Start difference. First operand 1382 states and 2003 transitions. Second operand 3 states. [2019-09-08 12:58:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:18,759 INFO L93 Difference]: Finished difference Result 3110 states and 4621 transitions. [2019-09-08 12:58:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:18,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:58:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:18,771 INFO L225 Difference]: With dead ends: 3110 [2019-09-08 12:58:18,772 INFO L226 Difference]: Without dead ends: 1998 [2019-09-08 12:58:18,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-09-08 12:58:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1771. [2019-09-08 12:58:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-09-08 12:58:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2632 transitions. [2019-09-08 12:58:18,899 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2632 transitions. Word has length 160 [2019-09-08 12:58:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:18,900 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2632 transitions. [2019-09-08 12:58:18,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2632 transitions. [2019-09-08 12:58:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:18,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:18,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:18,905 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash 753095009, now seen corresponding path program 1 times [2019-09-08 12:58:18,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:18,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:19,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:19,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:58:19,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:58:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:58:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:19,160 INFO L87 Difference]: Start difference. First operand 1771 states and 2632 transitions. Second operand 5 states. [2019-09-08 12:58:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:19,678 INFO L93 Difference]: Finished difference Result 4517 states and 6854 transitions. [2019-09-08 12:58:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:58:19,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 12:58:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:19,692 INFO L225 Difference]: With dead ends: 4517 [2019-09-08 12:58:19,692 INFO L226 Difference]: Without dead ends: 2926 [2019-09-08 12:58:19,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:58:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2019-09-08 12:58:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2924. [2019-09-08 12:58:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-09-08 12:58:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4420 transitions. [2019-09-08 12:58:19,866 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4420 transitions. Word has length 161 [2019-09-08 12:58:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:19,866 INFO L475 AbstractCegarLoop]: Abstraction has 2924 states and 4420 transitions. [2019-09-08 12:58:19,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:58:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4420 transitions. [2019-09-08 12:58:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:19,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:19,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:19,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash -217483962, now seen corresponding path program 1 times [2019-09-08 12:58:19,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:19,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:20,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:58:20,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:20,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:20,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:20,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:20,138 INFO L87 Difference]: Start difference. First operand 2924 states and 4420 transitions. Second operand 9 states. [2019-09-08 12:58:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:21,947 INFO L93 Difference]: Finished difference Result 14166 states and 21917 transitions. [2019-09-08 12:58:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:58:21,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-09-08 12:58:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:22,007 INFO L225 Difference]: With dead ends: 14166 [2019-09-08 12:58:22,007 INFO L226 Difference]: Without dead ends: 11461 [2019-09-08 12:58:22,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:58:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-08 12:58:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7578. [2019-09-08 12:58:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-09-08 12:58:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11480 transitions. [2019-09-08 12:58:22,705 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11480 transitions. Word has length 161 [2019-09-08 12:58:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:22,706 INFO L475 AbstractCegarLoop]: Abstraction has 7578 states and 11480 transitions. [2019-09-08 12:58:22,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11480 transitions. [2019-09-08 12:58:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:22,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:22,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:22,714 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1859935101, now seen corresponding path program 1 times [2019-09-08 12:58:22,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:22,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:22,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:22,883 INFO L87 Difference]: Start difference. First operand 7578 states and 11480 transitions. Second operand 4 states. [2019-09-08 12:58:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:23,639 INFO L93 Difference]: Finished difference Result 14483 states and 22537 transitions. [2019-09-08 12:58:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:23,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 12:58:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:23,691 INFO L225 Difference]: With dead ends: 14483 [2019-09-08 12:58:23,691 INFO L226 Difference]: Without dead ends: 9190 [2019-09-08 12:58:23,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-09-08 12:58:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 9188. [2019-09-08 12:58:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-09-08 12:58:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 14008 transitions. [2019-09-08 12:58:24,237 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 14008 transitions. Word has length 161 [2019-09-08 12:58:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:24,238 INFO L475 AbstractCegarLoop]: Abstraction has 9188 states and 14008 transitions. [2019-09-08 12:58:24,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 14008 transitions. [2019-09-08 12:58:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:58:24,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:24,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:24,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1831416783, now seen corresponding path program 1 times [2019-09-08 12:58:24,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:24,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:24,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:24,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:24,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:24,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:24,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:24,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:24,565 INFO L87 Difference]: Start difference. First operand 9188 states and 14008 transitions. Second operand 4 states. [2019-09-08 12:58:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:25,434 INFO L93 Difference]: Finished difference Result 24236 states and 36925 transitions. [2019-09-08 12:58:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:25,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 12:58:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:25,467 INFO L225 Difference]: With dead ends: 24236 [2019-09-08 12:58:25,467 INFO L226 Difference]: Without dead ends: 15071 [2019-09-08 12:58:25,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-09-08 12:58:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15048. [2019-09-08 12:58:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15048 states. [2019-09-08 12:58:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15048 states to 15048 states and 22725 transitions. [2019-09-08 12:58:26,409 INFO L78 Accepts]: Start accepts. Automaton has 15048 states and 22725 transitions. Word has length 161 [2019-09-08 12:58:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:26,409 INFO L475 AbstractCegarLoop]: Abstraction has 15048 states and 22725 transitions. [2019-09-08 12:58:26,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15048 states and 22725 transitions. [2019-09-08 12:58:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 12:58:26,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:26,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:26,423 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 668472032, now seen corresponding path program 1 times [2019-09-08 12:58:26,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:26,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:26,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:26,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:26,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:26,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:26,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:26,687 INFO L87 Difference]: Start difference. First operand 15048 states and 22725 transitions. Second operand 3 states. [2019-09-08 12:58:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:28,427 INFO L93 Difference]: Finished difference Result 43634 states and 66065 transitions. [2019-09-08 12:58:28,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:28,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 12:58:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:28,492 INFO L225 Difference]: With dead ends: 43634 [2019-09-08 12:58:28,493 INFO L226 Difference]: Without dead ends: 28974 [2019-09-08 12:58:28,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2019-09-08 12:58:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 28953. [2019-09-08 12:58:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28953 states. [2019-09-08 12:58:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28953 states to 28953 states and 43506 transitions. [2019-09-08 12:58:30,387 INFO L78 Accepts]: Start accepts. Automaton has 28953 states and 43506 transitions. Word has length 163 [2019-09-08 12:58:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:30,387 INFO L475 AbstractCegarLoop]: Abstraction has 28953 states and 43506 transitions. [2019-09-08 12:58:30,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 28953 states and 43506 transitions. [2019-09-08 12:58:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 12:58:30,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:30,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:30,404 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1439315485, now seen corresponding path program 1 times [2019-09-08 12:58:30,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:30,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:30,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:30,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:30,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:30,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:30,549 INFO L87 Difference]: Start difference. First operand 28953 states and 43506 transitions. Second operand 4 states. [2019-09-08 12:58:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:31,493 INFO L93 Difference]: Finished difference Result 46825 states and 70222 transitions. [2019-09-08 12:58:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:31,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-08 12:58:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:31,536 INFO L225 Difference]: With dead ends: 46825 [2019-09-08 12:58:31,536 INFO L226 Difference]: Without dead ends: 23474 [2019-09-08 12:58:31,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23474 states. [2019-09-08 12:58:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23474 to 23474. [2019-09-08 12:58:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-09-08 12:58:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 35144 transitions. [2019-09-08 12:58:33,521 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 35144 transitions. Word has length 163 [2019-09-08 12:58:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:33,522 INFO L475 AbstractCegarLoop]: Abstraction has 23474 states and 35144 transitions. [2019-09-08 12:58:33,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 35144 transitions. [2019-09-08 12:58:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 12:58:33,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:33,532 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1713355484, now seen corresponding path program 1 times [2019-09-08 12:58:33,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:33,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:33,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:33,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:33,611 INFO L87 Difference]: Start difference. First operand 23474 states and 35144 transitions. Second operand 3 states. [2019-09-08 12:58:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:35,065 INFO L93 Difference]: Finished difference Result 62336 states and 94477 transitions. [2019-09-08 12:58:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:35,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 12:58:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:35,147 INFO L225 Difference]: With dead ends: 62336 [2019-09-08 12:58:35,148 INFO L226 Difference]: Without dead ends: 39198 [2019-09-08 12:58:35,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39198 states. [2019-09-08 12:58:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39198 to 35602. [2019-09-08 12:58:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35602 states. [2019-09-08 12:58:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35602 states to 35602 states and 54441 transitions. [2019-09-08 12:58:36,871 INFO L78 Accepts]: Start accepts. Automaton has 35602 states and 54441 transitions. Word has length 167 [2019-09-08 12:58:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 35602 states and 54441 transitions. [2019-09-08 12:58:36,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35602 states and 54441 transitions. [2019-09-08 12:58:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 12:58:36,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:36,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:36,882 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:36,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2046979909, now seen corresponding path program 1 times [2019-09-08 12:58:36,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:36,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:37,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:37,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:37,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:37,034 INFO L87 Difference]: Start difference. First operand 35602 states and 54441 transitions. Second operand 4 states. [2019-09-08 12:58:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:40,377 INFO L93 Difference]: Finished difference Result 91626 states and 141514 transitions. [2019-09-08 12:58:40,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:40,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 12:58:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:40,465 INFO L225 Difference]: With dead ends: 91626 [2019-09-08 12:58:40,466 INFO L226 Difference]: Without dead ends: 61508 [2019-09-08 12:58:40,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61508 states. [2019-09-08 12:58:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61508 to 61506. [2019-09-08 12:58:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61506 states. [2019-09-08 12:58:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61506 states to 61506 states and 93776 transitions. [2019-09-08 12:58:43,120 INFO L78 Accepts]: Start accepts. Automaton has 61506 states and 93776 transitions. Word has length 168 [2019-09-08 12:58:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:43,121 INFO L475 AbstractCegarLoop]: Abstraction has 61506 states and 93776 transitions. [2019-09-08 12:58:43,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 61506 states and 93776 transitions. [2019-09-08 12:58:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 12:58:43,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:43,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:43,132 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1869790038, now seen corresponding path program 1 times [2019-09-08 12:58:43,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:43,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:43,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:43,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:58:43,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:58:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:58:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:43,301 INFO L87 Difference]: Start difference. First operand 61506 states and 93776 transitions. Second operand 4 states. [2019-09-08 12:58:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:49,219 INFO L93 Difference]: Finished difference Result 173627 states and 264401 transitions. [2019-09-08 12:58:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:49,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 12:58:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:49,359 INFO L225 Difference]: With dead ends: 173627 [2019-09-08 12:58:49,359 INFO L226 Difference]: Without dead ends: 112164 [2019-09-08 12:58:49,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112164 states. [2019-09-08 12:58:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112164 to 112112. [2019-09-08 12:58:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112112 states. [2019-09-08 12:58:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112112 states to 112112 states and 169267 transitions. [2019-09-08 12:58:56,508 INFO L78 Accepts]: Start accepts. Automaton has 112112 states and 169267 transitions. Word has length 168 [2019-09-08 12:58:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:56,509 INFO L475 AbstractCegarLoop]: Abstraction has 112112 states and 169267 transitions. [2019-09-08 12:58:56,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 112112 states and 169267 transitions. [2019-09-08 12:58:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 12:58:56,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:56,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:56,531 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash 479284410, now seen corresponding path program 1 times [2019-09-08 12:58:56,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:56,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:56,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:56,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:56,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:56,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:56,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:56,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:56,601 INFO L87 Difference]: Start difference. First operand 112112 states and 169267 transitions. Second operand 3 states. [2019-09-08 12:59:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:08,159 INFO L93 Difference]: Finished difference Result 336136 states and 507546 transitions. [2019-09-08 12:59:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:08,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 12:59:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:08,485 INFO L225 Difference]: With dead ends: 336136 [2019-09-08 12:59:08,485 INFO L226 Difference]: Without dead ends: 224133 [2019-09-08 12:59:08,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224133 states. [2019-09-08 12:59:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224133 to 112118. [2019-09-08 12:59:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112118 states. [2019-09-08 12:59:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112118 states to 112118 states and 169273 transitions. [2019-09-08 12:59:18,221 INFO L78 Accepts]: Start accepts. Automaton has 112118 states and 169273 transitions. Word has length 169 [2019-09-08 12:59:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:18,222 INFO L475 AbstractCegarLoop]: Abstraction has 112118 states and 169273 transitions. [2019-09-08 12:59:18,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 112118 states and 169273 transitions. [2019-09-08 12:59:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 12:59:18,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:18,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:18,240 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash -980457449, now seen corresponding path program 1 times [2019-09-08 12:59:18,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:18,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:18,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:18,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:18,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:18,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:18,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:18,382 INFO L87 Difference]: Start difference. First operand 112118 states and 169273 transitions. Second operand 4 states. [2019-09-08 12:59:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:24,099 INFO L93 Difference]: Finished difference Result 224194 states and 338490 transitions. [2019-09-08 12:59:24,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:59:24,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-09-08 12:59:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:24,251 INFO L225 Difference]: With dead ends: 224194 [2019-09-08 12:59:24,252 INFO L226 Difference]: Without dead ends: 112112 [2019-09-08 12:59:24,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112112 states. [2019-09-08 12:59:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112112 to 112112. [2019-09-08 12:59:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112112 states. [2019-09-08 12:59:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112112 states to 112112 states and 169261 transitions. [2019-09-08 12:59:34,301 INFO L78 Accepts]: Start accepts. Automaton has 112112 states and 169261 transitions. Word has length 170 [2019-09-08 12:59:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:34,302 INFO L475 AbstractCegarLoop]: Abstraction has 112112 states and 169261 transitions. [2019-09-08 12:59:34,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:59:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 112112 states and 169261 transitions. [2019-09-08 12:59:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 12:59:34,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:34,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:34,317 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1785538233, now seen corresponding path program 1 times [2019-09-08 12:59:34,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:34,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:34,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:34,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:34,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:34,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:34,420 INFO L87 Difference]: Start difference. First operand 112112 states and 169261 transitions. Second operand 3 states. [2019-09-08 12:59:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:42,540 INFO L93 Difference]: Finished difference Result 272839 states and 411054 transitions. [2019-09-08 12:59:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:42,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 12:59:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:42,778 INFO L225 Difference]: With dead ends: 272839 [2019-09-08 12:59:42,778 INFO L226 Difference]: Without dead ends: 161471 [2019-09-08 12:59:42,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161471 states. [2019-09-08 12:59:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161471 to 161419. [2019-09-08 12:59:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161419 states. [2019-09-08 12:59:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161419 states to 161419 states and 239938 transitions. [2019-09-08 12:59:53,188 INFO L78 Accepts]: Start accepts. Automaton has 161419 states and 239938 transitions. Word has length 170 [2019-09-08 12:59:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:53,188 INFO L475 AbstractCegarLoop]: Abstraction has 161419 states and 239938 transitions. [2019-09-08 12:59:53,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 161419 states and 239938 transitions. [2019-09-08 12:59:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 12:59:53,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:53,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:53,217 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash -50194899, now seen corresponding path program 1 times [2019-09-08 12:59:53,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:53,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:53,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:53,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:53,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:53,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:53,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:53,326 INFO L87 Difference]: Start difference. First operand 161419 states and 239938 transitions. Second operand 4 states. [2019-09-08 13:00:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:06,828 INFO L93 Difference]: Finished difference Result 287970 states and 430317 transitions. [2019-09-08 13:00:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:00:06,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:00:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:07,176 INFO L225 Difference]: With dead ends: 287970 [2019-09-08 13:00:07,176 INFO L226 Difference]: Without dead ends: 223045 [2019-09-08 13:00:07,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:00:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223045 states. [2019-09-08 13:00:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223045 to 161235. [2019-09-08 13:00:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161235 states. [2019-09-08 13:00:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161235 states to 161235 states and 239494 transitions. [2019-09-08 13:00:17,419 INFO L78 Accepts]: Start accepts. Automaton has 161235 states and 239494 transitions. Word has length 175 [2019-09-08 13:00:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:17,420 INFO L475 AbstractCegarLoop]: Abstraction has 161235 states and 239494 transitions. [2019-09-08 13:00:17,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:00:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 161235 states and 239494 transitions. [2019-09-08 13:00:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:00:17,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:17,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:17,450 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1494191448, now seen corresponding path program 1 times [2019-09-08 13:00:17,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:17,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:00:17,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:17,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:00:17,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:00:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:00:17,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:00:17,652 INFO L87 Difference]: Start difference. First operand 161235 states and 239494 transitions. Second operand 8 states. [2019-09-08 13:00:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:50,851 INFO L93 Difference]: Finished difference Result 567819 states and 846207 transitions. [2019-09-08 13:00:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:00:50,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 13:00:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:51,547 INFO L225 Difference]: With dead ends: 567819 [2019-09-08 13:00:51,547 INFO L226 Difference]: Without dead ends: 419429 [2019-09-08 13:00:51,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:00:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419429 states. [2019-09-08 13:01:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419429 to 188207. [2019-09-08 13:01:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188207 states. [2019-09-08 13:01:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188207 states to 188207 states and 280018 transitions. [2019-09-08 13:01:11,475 INFO L78 Accepts]: Start accepts. Automaton has 188207 states and 280018 transitions. Word has length 175 [2019-09-08 13:01:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:11,476 INFO L475 AbstractCegarLoop]: Abstraction has 188207 states and 280018 transitions. [2019-09-08 13:01:11,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:01:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 188207 states and 280018 transitions. [2019-09-08 13:01:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:01:11,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:11,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:11,497 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1921896108, now seen corresponding path program 1 times [2019-09-08 13:01:11,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:11,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:01:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:11,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:01:11,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:01:11,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:01:11,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:01:11,705 INFO L87 Difference]: Start difference. First operand 188207 states and 280018 transitions. Second operand 4 states. [2019-09-08 13:01:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:24,595 INFO L93 Difference]: Finished difference Result 362545 states and 539614 transitions. [2019-09-08 13:01:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:01:24,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:01:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:24,890 INFO L225 Difference]: With dead ends: 362545 [2019-09-08 13:01:24,891 INFO L226 Difference]: Without dead ends: 174649 [2019-09-08 13:01:25,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:01:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174649 states. [2019-09-08 13:01:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174649 to 174585. [2019-09-08 13:01:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174585 states. [2019-09-08 13:01:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174585 states to 174585 states and 259877 transitions. [2019-09-08 13:01:42,060 INFO L78 Accepts]: Start accepts. Automaton has 174585 states and 259877 transitions. Word has length 175 [2019-09-08 13:01:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:42,061 INFO L475 AbstractCegarLoop]: Abstraction has 174585 states and 259877 transitions. [2019-09-08 13:01:42,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:01:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 174585 states and 259877 transitions. [2019-09-08 13:01:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 13:01:42,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:42,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:42,081 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash 599248830, now seen corresponding path program 1 times [2019-09-08 13:01:42,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:42,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:01:42,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:42,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:01:42,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:01:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:01:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:01:42,266 INFO L87 Difference]: Start difference. First operand 174585 states and 259877 transitions. Second operand 4 states. [2019-09-08 13:01:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:56,527 INFO L93 Difference]: Finished difference Result 349225 states and 519807 transitions. [2019-09-08 13:01:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:01:56,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-09-08 13:01:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:56,784 INFO L225 Difference]: With dead ends: 349225 [2019-09-08 13:01:56,784 INFO L226 Difference]: Without dead ends: 174799 [2019-09-08 13:01:56,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:01:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174799 states. [2019-09-08 13:02:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174799 to 174687. [2019-09-08 13:02:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174687 states. [2019-09-08 13:02:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174687 states to 174687 states and 259977 transitions. [2019-09-08 13:02:13,589 INFO L78 Accepts]: Start accepts. Automaton has 174687 states and 259977 transitions. Word has length 177 [2019-09-08 13:02:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:13,589 INFO L475 AbstractCegarLoop]: Abstraction has 174687 states and 259977 transitions. [2019-09-08 13:02:13,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:02:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 174687 states and 259977 transitions. [2019-09-08 13:02:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:02:13,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:13,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:13,609 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1715947558, now seen corresponding path program 1 times [2019-09-08 13:02:13,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:13,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:02:13,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:02:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:02:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:13,672 INFO L87 Difference]: Start difference. First operand 174687 states and 259977 transitions. Second operand 3 states. [2019-09-08 13:02:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:42,941 INFO L93 Difference]: Finished difference Result 486313 states and 723983 transitions. [2019-09-08 13:02:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:42,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 13:02:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:43,500 INFO L225 Difference]: With dead ends: 486313 [2019-09-08 13:02:43,500 INFO L226 Difference]: Without dead ends: 349163 [2019-09-08 13:02:43,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349163 states. [2019-09-08 13:02:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349163 to 174697. [2019-09-08 13:02:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174697 states. [2019-09-08 13:03:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174697 states to 174697 states and 259987 transitions. [2019-09-08 13:03:05,789 INFO L78 Accepts]: Start accepts. Automaton has 174697 states and 259987 transitions. Word has length 178 [2019-09-08 13:03:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:05,789 INFO L475 AbstractCegarLoop]: Abstraction has 174697 states and 259987 transitions. [2019-09-08 13:03:05,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:03:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 174697 states and 259987 transitions. [2019-09-08 13:03:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:03:05,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:05,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:05,807 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1966026327, now seen corresponding path program 1 times [2019-09-08 13:03:05,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:05,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:05,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:05,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:05,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:03:05,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:03:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:03:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:03:05,927 INFO L87 Difference]: Start difference. First operand 174697 states and 259987 transitions. Second operand 4 states. [2019-09-08 13:03:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:03:26,364 INFO L93 Difference]: Finished difference Result 346700 states and 521193 transitions. [2019-09-08 13:03:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:03:26,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:03:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:03:26,767 INFO L225 Difference]: With dead ends: 346700 [2019-09-08 13:03:26,767 INFO L226 Difference]: Without dead ends: 262339 [2019-09-08 13:03:26,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262339 states. [2019-09-08 13:03:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262339 to 174557. [2019-09-08 13:03:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174557 states. [2019-09-08 13:03:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174557 states to 174557 states and 259635 transitions. [2019-09-08 13:03:47,693 INFO L78 Accepts]: Start accepts. Automaton has 174557 states and 259635 transitions. Word has length 179 [2019-09-08 13:03:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:47,694 INFO L475 AbstractCegarLoop]: Abstraction has 174557 states and 259635 transitions. [2019-09-08 13:03:47,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 174557 states and 259635 transitions. [2019-09-08 13:03:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:03:47,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:47,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:03:47,715 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash 264449639, now seen corresponding path program 1 times [2019-09-08 13:03:47,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:47,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:47,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:47,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:47,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:03:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:03:47,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:03:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:03:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:03:47,863 INFO L87 Difference]: Start difference. First operand 174557 states and 259635 transitions. Second operand 5 states. [2019-09-08 13:04:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:03,022 INFO L93 Difference]: Finished difference Result 339213 states and 505524 transitions. [2019-09-08 13:04:03,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:04:03,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-09-08 13:04:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:03,274 INFO L225 Difference]: With dead ends: 339213 [2019-09-08 13:04:03,275 INFO L226 Difference]: Without dead ends: 174559 [2019-09-08 13:04:03,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:04:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174559 states. [2019-09-08 13:04:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174559 to 174311. [2019-09-08 13:04:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174311 states. [2019-09-08 13:04:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174311 states to 174311 states and 257713 transitions. [2019-09-08 13:04:23,532 INFO L78 Accepts]: Start accepts. Automaton has 174311 states and 257713 transitions. Word has length 179 [2019-09-08 13:04:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:23,532 INFO L475 AbstractCegarLoop]: Abstraction has 174311 states and 257713 transitions. [2019-09-08 13:04:23,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:04:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 174311 states and 257713 transitions. [2019-09-08 13:04:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:04:23,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:23,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:23,553 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 560073612, now seen corresponding path program 1 times [2019-09-08 13:04:23,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:23,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:23,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 13:04:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:23,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:23,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:23,793 INFO L87 Difference]: Start difference. First operand 174311 states and 257713 transitions. Second operand 4 states. [2019-09-08 13:04:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:38,897 INFO L93 Difference]: Finished difference Result 348807 states and 515612 transitions. [2019-09-08 13:04:38,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:04:38,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:04:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:39,122 INFO L225 Difference]: With dead ends: 348807 [2019-09-08 13:04:39,122 INFO L226 Difference]: Without dead ends: 174770 [2019-09-08 13:04:39,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:04:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174770 states. [2019-09-08 13:04:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174770 to 174557. [2019-09-08 13:04:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174557 states. [2019-09-08 13:04:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174557 states to 174557 states and 257959 transitions. [2019-09-08 13:04:54,215 INFO L78 Accepts]: Start accepts. Automaton has 174557 states and 257959 transitions. Word has length 179 [2019-09-08 13:04:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:54,215 INFO L475 AbstractCegarLoop]: Abstraction has 174557 states and 257959 transitions. [2019-09-08 13:04:54,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:04:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 174557 states and 257959 transitions. [2019-09-08 13:04:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:04:54,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:54,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:54,237 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1797210275, now seen corresponding path program 1 times [2019-09-08 13:04:54,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:54,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:04:54,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:54,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:54,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:54,390 INFO L87 Difference]: Start difference. First operand 174557 states and 257959 transitions. Second operand 4 states. [2019-09-08 13:05:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:10,750 INFO L93 Difference]: Finished difference Result 262640 states and 387810 transitions. [2019-09-08 13:05:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:10,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-08 13:05:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:10,981 INFO L225 Difference]: With dead ends: 262640 [2019-09-08 13:05:10,982 INFO L226 Difference]: Without dead ends: 158149 [2019-09-08 13:05:11,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158149 states. [2019-09-08 13:05:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158149 to 158149. [2019-09-08 13:05:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158149 states. [2019-09-08 13:05:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158149 states to 158149 states and 233892 transitions. [2019-09-08 13:05:25,696 INFO L78 Accepts]: Start accepts. Automaton has 158149 states and 233892 transitions. Word has length 179 [2019-09-08 13:05:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:25,697 INFO L475 AbstractCegarLoop]: Abstraction has 158149 states and 233892 transitions. [2019-09-08 13:05:25,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 158149 states and 233892 transitions. [2019-09-08 13:05:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:05:25,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:25,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:25,714 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 379050495, now seen corresponding path program 1 times [2019-09-08 13:05:25,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:25,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:27,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:27,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:05:27,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:05:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:05:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:05:27,281 INFO L87 Difference]: Start difference. First operand 158149 states and 233892 transitions. Second operand 21 states. [2019-09-08 13:05:28,115 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 13:05:28,276 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 13:05:28,640 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 13:05:28,888 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 13:05:29,034 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 13:05:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:47,899 INFO L93 Difference]: Finished difference Result 288673 states and 430981 transitions. [2019-09-08 13:05:47,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 13:05:47,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-08 13:05:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:48,111 INFO L225 Difference]: With dead ends: 288673 [2019-09-08 13:05:48,112 INFO L226 Difference]: Without dead ends: 161042 [2019-09-08 13:05:48,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 13:05:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161042 states. [2019-09-08 13:06:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161042 to 158801. [2019-09-08 13:06:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158801 states. [2019-09-08 13:06:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158801 states to 158801 states and 234655 transitions. [2019-09-08 13:06:01,866 INFO L78 Accepts]: Start accepts. Automaton has 158801 states and 234655 transitions. Word has length 181 [2019-09-08 13:06:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:01,867 INFO L475 AbstractCegarLoop]: Abstraction has 158801 states and 234655 transitions. [2019-09-08 13:06:01,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:06:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 158801 states and 234655 transitions. [2019-09-08 13:06:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:06:01,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:01,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:01,884 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -313401688, now seen corresponding path program 1 times [2019-09-08 13:06:01,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:01,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:01,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:01,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:01,993 INFO L87 Difference]: Start difference. First operand 158801 states and 234655 transitions. Second operand 4 states. [2019-09-08 13:06:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:31,380 INFO L93 Difference]: Finished difference Result 444109 states and 666229 transitions. [2019-09-08 13:06:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:31,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-08 13:06:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:31,863 INFO L225 Difference]: With dead ends: 444109 [2019-09-08 13:06:31,864 INFO L226 Difference]: Without dead ends: 298832 [2019-09-08 13:06:31,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298832 states. [2019-09-08 13:06:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298832 to 157576. [2019-09-08 13:06:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157576 states. [2019-09-08 13:06:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157576 states to 157576 states and 233111 transitions. [2019-09-08 13:06:47,246 INFO L78 Accepts]: Start accepts. Automaton has 157576 states and 233111 transitions. Word has length 181 [2019-09-08 13:06:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:47,247 INFO L475 AbstractCegarLoop]: Abstraction has 157576 states and 233111 transitions. [2019-09-08 13:06:47,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 157576 states and 233111 transitions. [2019-09-08 13:06:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:06:47,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:47,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:47,267 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 601955891, now seen corresponding path program 1 times [2019-09-08 13:06:47,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:47,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:47,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:48,373 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-09-08 13:06:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:49,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:49,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:06:49,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:06:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:06:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:06:49,113 INFO L87 Difference]: Start difference. First operand 157576 states and 233111 transitions. Second operand 21 states. [2019-09-08 13:06:49,562 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-08 13:06:49,891 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 13:06:50,087 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 13:06:50,358 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 13:06:50,568 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-08 13:06:50,786 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 13:06:51,023 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 13:06:51,185 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 13:07:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:07,871 INFO L93 Difference]: Finished difference Result 228505 states and 338813 transitions. [2019-09-08 13:07:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 13:07:07,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2019-09-08 13:07:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:08,159 INFO L225 Difference]: With dead ends: 228505 [2019-09-08 13:07:08,159 INFO L226 Difference]: Without dead ends: 166180 [2019-09-08 13:07:08,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 13:07:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166180 states. [2019-09-08 13:07:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166180 to 163762. [2019-09-08 13:07:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163762 states. [2019-09-08 13:07:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163762 states to 163762 states and 241987 transitions. [2019-09-08 13:07:28,025 INFO L78 Accepts]: Start accepts. Automaton has 163762 states and 241987 transitions. Word has length 181 [2019-09-08 13:07:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:28,025 INFO L475 AbstractCegarLoop]: Abstraction has 163762 states and 241987 transitions. [2019-09-08 13:07:28,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:07:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 163762 states and 241987 transitions. [2019-09-08 13:07:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:07:28,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:28,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:28,043 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 418972106, now seen corresponding path program 1 times [2019-09-08 13:07:28,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:28,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:28,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:28,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:28,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:28,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:28,112 INFO L87 Difference]: Start difference. First operand 163762 states and 241987 transitions. Second operand 3 states. [2019-09-08 13:07:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:44,939 INFO L93 Difference]: Finished difference Result 304956 states and 448658 transitions. [2019-09-08 13:07:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:44,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:07:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:45,578 INFO L225 Difference]: With dead ends: 304956 [2019-09-08 13:07:45,579 INFO L226 Difference]: Without dead ends: 188601 [2019-09-08 13:07:45,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188601 states. [2019-09-08 13:08:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188601 to 162568. [2019-09-08 13:08:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162568 states. [2019-09-08 13:08:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162568 states to 162568 states and 239731 transitions. [2019-09-08 13:08:00,930 INFO L78 Accepts]: Start accepts. Automaton has 162568 states and 239731 transitions. Word has length 182 [2019-09-08 13:08:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:00,930 INFO L475 AbstractCegarLoop]: Abstraction has 162568 states and 239731 transitions. [2019-09-08 13:08:00,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 162568 states and 239731 transitions. [2019-09-08 13:08:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:08:00,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:00,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:00,948 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -153314295, now seen corresponding path program 1 times [2019-09-08 13:08:00,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:00,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:01,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:01,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:01,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:01,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:01,026 INFO L87 Difference]: Start difference. First operand 162568 states and 239731 transitions. Second operand 3 states. [2019-09-08 13:08:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:18,273 INFO L93 Difference]: Finished difference Result 283953 states and 419622 transitions. [2019-09-08 13:08:18,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:18,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:08:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:18,494 INFO L225 Difference]: With dead ends: 283953 [2019-09-08 13:08:18,494 INFO L226 Difference]: Without dead ends: 161614 [2019-09-08 13:08:18,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161614 states. [2019-09-08 13:08:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161614 to 161614. [2019-09-08 13:08:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161614 states. [2019-09-08 13:08:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161614 states to 161614 states and 237980 transitions. [2019-09-08 13:08:33,444 INFO L78 Accepts]: Start accepts. Automaton has 161614 states and 237980 transitions. Word has length 182 [2019-09-08 13:08:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:33,445 INFO L475 AbstractCegarLoop]: Abstraction has 161614 states and 237980 transitions. [2019-09-08 13:08:33,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 161614 states and 237980 transitions. [2019-09-08 13:08:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:08:33,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:33,462 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:33,462 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2090814522, now seen corresponding path program 1 times [2019-09-08 13:08:33,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:33,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:33,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:33,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:33,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:33,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:33,533 INFO L87 Difference]: Start difference. First operand 161614 states and 237980 transitions. Second operand 3 states. [2019-09-08 13:08:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:48,269 INFO L93 Difference]: Finished difference Result 276974 states and 407661 transitions. [2019-09-08 13:08:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:48,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:08:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:48,497 INFO L225 Difference]: With dead ends: 276974 [2019-09-08 13:08:48,497 INFO L226 Difference]: Without dead ends: 162377 [2019-09-08 13:08:48,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162377 states. [2019-09-08 13:09:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162377 to 160505. [2019-09-08 13:09:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160505 states. [2019-09-08 13:09:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160505 states to 160505 states and 235698 transitions. [2019-09-08 13:09:08,302 INFO L78 Accepts]: Start accepts. Automaton has 160505 states and 235698 transitions. Word has length 182 [2019-09-08 13:09:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:08,302 INFO L475 AbstractCegarLoop]: Abstraction has 160505 states and 235698 transitions. [2019-09-08 13:09:08,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 160505 states and 235698 transitions. [2019-09-08 13:09:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:09:08,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:08,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:08,320 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1630412605, now seen corresponding path program 1 times [2019-09-08 13:09:08,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:08,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:08,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:08,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 13:09:08,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:08,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:08,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:08,390 INFO L87 Difference]: Start difference. First operand 160505 states and 235698 transitions. Second operand 3 states. [2019-09-08 13:09:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:24,755 INFO L93 Difference]: Finished difference Result 297534 states and 435237 transitions. [2019-09-08 13:09:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:24,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:09:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:25,018 INFO L225 Difference]: With dead ends: 297534 [2019-09-08 13:09:25,018 INFO L226 Difference]: Without dead ends: 176669 [2019-09-08 13:09:25,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176669 states. [2019-09-08 13:09:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176669 to 159432. [2019-09-08 13:09:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159432 states. [2019-09-08 13:09:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159432 states to 159432 states and 233719 transitions. [2019-09-08 13:09:40,097 INFO L78 Accepts]: Start accepts. Automaton has 159432 states and 233719 transitions. Word has length 182 [2019-09-08 13:09:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:40,098 INFO L475 AbstractCegarLoop]: Abstraction has 159432 states and 233719 transitions. [2019-09-08 13:09:40,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 159432 states and 233719 transitions. [2019-09-08 13:09:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:09:40,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:40,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:40,115 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -159096107, now seen corresponding path program 1 times [2019-09-08 13:09:40,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:40,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:40,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:40,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:40,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:40,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:40,193 INFO L87 Difference]: Start difference. First operand 159432 states and 233719 transitions. Second operand 3 states. [2019-09-08 13:09:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:59,264 INFO L93 Difference]: Finished difference Result 277532 states and 405614 transitions. [2019-09-08 13:09:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:59,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 13:09:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:59,650 INFO L225 Difference]: With dead ends: 277532 [2019-09-08 13:09:59,651 INFO L226 Difference]: Without dead ends: 162902 [2019-09-08 13:09:59,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162902 states.