java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:19:45,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:19:45,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:19:45,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:19:45,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:19:45,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:19:45,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:19:45,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:19:45,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:19:45,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:19:45,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:19:45,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:19:45,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:19:45,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:19:45,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:19:45,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:19:45,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:19:45,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:19:45,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:19:45,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:19:45,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:19:45,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:19:45,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:19:45,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:19:45,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:19:45,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:19:45,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:19:45,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:19:45,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:19:45,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:19:45,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:19:45,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:19:45,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:19:45,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:19:45,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:19:45,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:19:45,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:19:45,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:19:45,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:19:45,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:19:45,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:19:45,965 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:19:45,980 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:19:45,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:19:45,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:19:45,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:19:45,982 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:19:45,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:19:45,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:19:45,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:19:45,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:19:45,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:19:45,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:19:45,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:19:45,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:19:45,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:19:45,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:19:45,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:19:45,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:19:45,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:19:45,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:19:45,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:19:45,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:19:45,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:19:45,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:19:45,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:19:45,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:19:45,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:19:45,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:19:45,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:19:45,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:19:46,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:19:46,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:19:46,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:19:46,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:19:46,036 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:19:46,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:19:46,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6320d80/43ef0fa5612347d2aeafbfcff19a3928/FLAGcd58dc941 [2019-09-08 12:19:46,598 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:19:46,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:19:46,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6320d80/43ef0fa5612347d2aeafbfcff19a3928/FLAGcd58dc941 [2019-09-08 12:19:46,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6320d80/43ef0fa5612347d2aeafbfcff19a3928 [2019-09-08 12:19:46,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:19:46,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:19:46,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:19:46,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:19:46,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:19:46,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:19:46" (1/1) ... [2019-09-08 12:19:46,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3030493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:46, skipping insertion in model container [2019-09-08 12:19:46,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:19:46" (1/1) ... [2019-09-08 12:19:46,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:19:46,986 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:19:47,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:19:47,347 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:19:47,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:19:47,456 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:19:47,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47 WrapperNode [2019-09-08 12:19:47,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:19:47,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:19:47,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:19:47,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:19:47,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (1/1) ... [2019-09-08 12:19:47,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:19:47,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:19:47,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:19:47,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:19:47,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (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:19:47,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:19:47,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:19:47,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:19:47,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:19:47,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:19:47,606 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:19:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:19:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:19:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:19:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:19:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:19:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:19:48,346 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:19:48,347 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:19:48,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:19:48 BoogieIcfgContainer [2019-09-08 12:19:48,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:19:48,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:19:48,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:19:48,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:19:48,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:19:46" (1/3) ... [2019-09-08 12:19:48,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5598d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:19:48, skipping insertion in model container [2019-09-08 12:19:48,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:47" (2/3) ... [2019-09-08 12:19:48,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5598d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:19:48, skipping insertion in model container [2019-09-08 12:19:48,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:19:48" (3/3) ... [2019-09-08 12:19:48,363 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:19:48,373 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:19:48,393 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:19:48,413 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:19:48,450 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:19:48,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:19:48,451 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:19:48,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:19:48,451 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:19:48,451 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:19:48,451 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:19:48,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:19:48,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:19:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-08 12:19:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:19:48,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:48,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,485 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash 690229661, now seen corresponding path program 1 times [2019-09-08 12:19:48,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:48,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:48,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:49,016 INFO L134 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:19:49,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:49,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:49,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:49,049 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-09-08 12:19:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:49,196 INFO L93 Difference]: Finished difference Result 267 states and 429 transitions. [2019-09-08 12:19:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:49,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 12:19:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:49,217 INFO L225 Difference]: With dead ends: 267 [2019-09-08 12:19:49,217 INFO L226 Difference]: Without dead ends: 183 [2019-09-08 12:19:49,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-08 12:19:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-09-08 12:19:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-08 12:19:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2019-09-08 12:19:49,287 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 77 [2019-09-08 12:19:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:49,287 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2019-09-08 12:19:49,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2019-09-08 12:19:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:19:49,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:49,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:49,291 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash -675217057, now seen corresponding path program 1 times [2019-09-08 12:19:49,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:49,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:49,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:49,446 INFO L134 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:19:49,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:49,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:49,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:49,449 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand 3 states. [2019-09-08 12:19:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:49,512 INFO L93 Difference]: Finished difference Result 433 states and 660 transitions. [2019-09-08 12:19:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:49,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 12:19:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:49,519 INFO L225 Difference]: With dead ends: 433 [2019-09-08 12:19:49,519 INFO L226 Difference]: Without dead ends: 299 [2019-09-08 12:19:49,521 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:19:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-08 12:19:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2019-09-08 12:19:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-08 12:19:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-08 12:19:49,558 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 78 [2019-09-08 12:19:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:49,560 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-08 12:19:49,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-08 12:19:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:19:49,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:49,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,564 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash 435331309, now seen corresponding path program 1 times [2019-09-08 12:19:49,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:49,733 INFO L134 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:19:49,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:49,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:49,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:49,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:49,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:49,737 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 3 states. [2019-09-08 12:19:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:49,814 INFO L93 Difference]: Finished difference Result 765 states and 1186 transitions. [2019-09-08 12:19:49,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:49,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:19:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:49,821 INFO L225 Difference]: With dead ends: 765 [2019-09-08 12:19:49,822 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 12:19:49,826 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:19:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 12:19:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2019-09-08 12:19:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 12:19:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 784 transitions. [2019-09-08 12:19:49,869 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 784 transitions. Word has length 79 [2019-09-08 12:19:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:49,870 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 784 transitions. [2019-09-08 12:19:49,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 784 transitions. [2019-09-08 12:19:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:19:49,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:49,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,877 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -903037179, now seen corresponding path program 1 times [2019-09-08 12:19:49,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:49,972 INFO L134 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:19:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:49,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:49,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:49,974 INFO L87 Difference]: Start difference. First operand 513 states and 784 transitions. Second operand 3 states. [2019-09-08 12:19:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:50,035 INFO L93 Difference]: Finished difference Result 1381 states and 2154 transitions. [2019-09-08 12:19:50,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:50,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 12:19:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:50,042 INFO L225 Difference]: With dead ends: 1381 [2019-09-08 12:19:50,042 INFO L226 Difference]: Without dead ends: 915 [2019-09-08 12:19:50,045 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:19:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-08 12:19:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-08 12:19:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-08 12:19:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1408 transitions. [2019-09-08 12:19:50,116 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1408 transitions. Word has length 80 [2019-09-08 12:19:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:50,117 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1408 transitions. [2019-09-08 12:19:50,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1408 transitions. [2019-09-08 12:19:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:19:50,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:50,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,119 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash -441467371, now seen corresponding path program 1 times [2019-09-08 12:19:50,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:50,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:50,196 INFO L134 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:19:50,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:50,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:50,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:50,198 INFO L87 Difference]: Start difference. First operand 913 states and 1408 transitions. Second operand 3 states. [2019-09-08 12:19:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:50,276 INFO L93 Difference]: Finished difference Result 2517 states and 3922 transitions. [2019-09-08 12:19:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:50,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 12:19:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:50,288 INFO L225 Difference]: With dead ends: 2517 [2019-09-08 12:19:50,288 INFO L226 Difference]: Without dead ends: 1651 [2019-09-08 12:19:50,291 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:19:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-09-08 12:19:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2019-09-08 12:19:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 12:19:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2544 transitions. [2019-09-08 12:19:50,378 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2544 transitions. Word has length 81 [2019-09-08 12:19:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:50,379 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2544 transitions. [2019-09-08 12:19:50,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2544 transitions. [2019-09-08 12:19:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:19:50,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:50,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,385 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -22564349, now seen corresponding path program 1 times [2019-09-08 12:19:50,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:50,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:50,501 INFO L134 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:19:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:50,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:50,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:50,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:50,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:50,503 INFO L87 Difference]: Start difference. First operand 1649 states and 2544 transitions. Second operand 5 states. [2019-09-08 12:19:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:50,986 INFO L93 Difference]: Finished difference Result 4853 states and 7538 transitions. [2019-09-08 12:19:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:50,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:19:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:51,004 INFO L225 Difference]: With dead ends: 4853 [2019-09-08 12:19:51,005 INFO L226 Difference]: Without dead ends: 3251 [2019-09-08 12:19:51,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2019-09-08 12:19:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3249. [2019-09-08 12:19:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-08 12:19:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 5008 transitions. [2019-09-08 12:19:51,188 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 5008 transitions. Word has length 82 [2019-09-08 12:19:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:51,188 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 5008 transitions. [2019-09-08 12:19:51,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 5008 transitions. [2019-09-08 12:19:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:19:51,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:51,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,192 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1698766526, now seen corresponding path program 1 times [2019-09-08 12:19:51,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:51,302 INFO L134 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:19:51,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:51,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:51,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:51,305 INFO L87 Difference]: Start difference. First operand 3249 states and 5008 transitions. Second operand 5 states. [2019-09-08 12:19:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:51,613 INFO L93 Difference]: Finished difference Result 6451 states and 9969 transitions. [2019-09-08 12:19:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:51,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:19:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:51,630 INFO L225 Difference]: With dead ends: 6451 [2019-09-08 12:19:51,630 INFO L226 Difference]: Without dead ends: 3249 [2019-09-08 12:19:51,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-09-08 12:19:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3249. [2019-09-08 12:19:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-08 12:19:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4976 transitions. [2019-09-08 12:19:51,810 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4976 transitions. Word has length 82 [2019-09-08 12:19:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 4976 transitions. [2019-09-08 12:19:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4976 transitions. [2019-09-08 12:19:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:19:51,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:51,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -143264007, now seen corresponding path program 1 times [2019-09-08 12:19:51,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:51,909 INFO L134 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:19:51,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:51,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:51,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:51,911 INFO L87 Difference]: Start difference. First operand 3249 states and 4976 transitions. Second operand 5 states. [2019-09-08 12:19:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:52,241 INFO L93 Difference]: Finished difference Result 6451 states and 9905 transitions. [2019-09-08 12:19:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:52,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:19:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:52,262 INFO L225 Difference]: With dead ends: 6451 [2019-09-08 12:19:52,262 INFO L226 Difference]: Without dead ends: 3249 [2019-09-08 12:19:52,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-09-08 12:19:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3249. [2019-09-08 12:19:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2019-09-08 12:19:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4944 transitions. [2019-09-08 12:19:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4944 transitions. Word has length 82 [2019-09-08 12:19:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:52,441 INFO L475 AbstractCegarLoop]: Abstraction has 3249 states and 4944 transitions. [2019-09-08 12:19:52,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4944 transitions. [2019-09-08 12:19:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:19:52,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:52,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,442 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1607335564, now seen corresponding path program 1 times [2019-09-08 12:19:52,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:52,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:19:52,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:52,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:52,594 INFO L87 Difference]: Start difference. First operand 3249 states and 4944 transitions. Second operand 8 states. [2019-09-08 12:19:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:54,131 INFO L93 Difference]: Finished difference Result 35269 states and 53914 transitions. [2019-09-08 12:19:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:19:54,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 12:19:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:54,254 INFO L225 Difference]: With dead ends: 35269 [2019-09-08 12:19:54,254 INFO L226 Difference]: Without dead ends: 32067 [2019-09-08 12:19:54,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:19:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32067 states. [2019-09-08 12:19:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32067 to 9649. [2019-09-08 12:19:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9649 states. [2019-09-08 12:19:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9649 states to 9649 states and 14608 transitions. [2019-09-08 12:19:55,340 INFO L78 Accepts]: Start accepts. Automaton has 9649 states and 14608 transitions. Word has length 82 [2019-09-08 12:19:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:55,341 INFO L475 AbstractCegarLoop]: Abstraction has 9649 states and 14608 transitions. [2019-09-08 12:19:55,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 9649 states and 14608 transitions. [2019-09-08 12:19:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:19:55,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:55,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:55,342 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 645559087, now seen corresponding path program 1 times [2019-09-08 12:19:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:55,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:55,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:55,422 INFO L87 Difference]: Start difference. First operand 9649 states and 14608 transitions. Second operand 3 states. [2019-09-08 12:19:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:56,227 INFO L93 Difference]: Finished difference Result 23541 states and 35506 transitions. [2019-09-08 12:19:56,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:56,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 12:19:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:56,262 INFO L225 Difference]: With dead ends: 23541 [2019-09-08 12:19:56,263 INFO L226 Difference]: Without dead ends: 13939 [2019-09-08 12:19:56,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:19:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13939 states. [2019-09-08 12:19:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13939 to 13841. [2019-09-08 12:19:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-09-08 12:19:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 20592 transitions. [2019-09-08 12:19:57,042 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 20592 transitions. Word has length 84 [2019-09-08 12:19:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:57,042 INFO L475 AbstractCegarLoop]: Abstraction has 13841 states and 20592 transitions. [2019-09-08 12:19:57,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 20592 transitions. [2019-09-08 12:19:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:19:57,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:57,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,044 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash 665608430, now seen corresponding path program 1 times [2019-09-08 12:19:57,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:57,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:57,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:57,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:57,384 INFO L87 Difference]: Start difference. First operand 13841 states and 20592 transitions. Second operand 8 states. [2019-09-08 12:19:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:59,071 INFO L93 Difference]: Finished difference Result 30841 states and 46036 transitions. [2019-09-08 12:19:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:59,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 12:19:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:59,099 INFO L225 Difference]: With dead ends: 30841 [2019-09-08 12:19:59,099 INFO L226 Difference]: Without dead ends: 17047 [2019-09-08 12:19:59,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:19:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17047 states. [2019-09-08 12:19:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17047 to 13841. [2019-09-08 12:19:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2019-09-08 12:19:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 20496 transitions. [2019-09-08 12:19:59,853 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 20496 transitions. Word has length 84 [2019-09-08 12:19:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:59,854 INFO L475 AbstractCegarLoop]: Abstraction has 13841 states and 20496 transitions. [2019-09-08 12:19:59,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 20496 transitions. [2019-09-08 12:19:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:19:59,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:59,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,856 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash 851756344, now seen corresponding path program 1 times [2019-09-08 12:19:59,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:59,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:59,914 INFO L134 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:19:59,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:59,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:59,916 INFO L87 Difference]: Start difference. First operand 13841 states and 20496 transitions. Second operand 3 states. [2019-09-08 12:20:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:01,475 INFO L93 Difference]: Finished difference Result 31128 states and 46518 transitions. [2019-09-08 12:20:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:20:01,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 12:20:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:01,504 INFO L225 Difference]: With dead ends: 31128 [2019-09-08 12:20:01,504 INFO L226 Difference]: Without dead ends: 21525 [2019-09-08 12:20:01,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:20:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21525 states. [2019-09-08 12:20:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21525 to 21523. [2019-09-08 12:20:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21523 states. [2019-09-08 12:20:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21523 states to 21523 states and 31826 transitions. [2019-09-08 12:20:02,683 INFO L78 Accepts]: Start accepts. Automaton has 21523 states and 31826 transitions. Word has length 85 [2019-09-08 12:20:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:02,683 INFO L475 AbstractCegarLoop]: Abstraction has 21523 states and 31826 transitions. [2019-09-08 12:20:02,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:20:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21523 states and 31826 transitions. [2019-09-08 12:20:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:20:02,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:02,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,684 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash -842884464, now seen corresponding path program 1 times [2019-09-08 12:20:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:02,777 INFO L134 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:20:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:20:02,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:20:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:20:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:20:02,779 INFO L87 Difference]: Start difference. First operand 21523 states and 31826 transitions. Second operand 5 states. [2019-09-08 12:20:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:04,740 INFO L93 Difference]: Finished difference Result 41735 states and 61450 transitions. [2019-09-08 12:20:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:20:04,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:20:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:04,791 INFO L225 Difference]: With dead ends: 41735 [2019-09-08 12:20:04,792 INFO L226 Difference]: Without dead ends: 41733 [2019-09-08 12:20:04,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:20:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41733 states. [2019-09-08 12:20:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41733 to 22355. [2019-09-08 12:20:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22355 states. [2019-09-08 12:20:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22355 states to 22355 states and 32626 transitions. [2019-09-08 12:20:06,796 INFO L78 Accepts]: Start accepts. Automaton has 22355 states and 32626 transitions. Word has length 85 [2019-09-08 12:20:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:06,797 INFO L475 AbstractCegarLoop]: Abstraction has 22355 states and 32626 transitions. [2019-09-08 12:20:06,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:20:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 22355 states and 32626 transitions. [2019-09-08 12:20:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:20:06,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:06,808 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:06,809 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 897657587, now seen corresponding path program 1 times [2019-09-08 12:20:06,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:06,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:06,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:20:06,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:20:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:20:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:20:06,888 INFO L87 Difference]: Start difference. First operand 22355 states and 32626 transitions. Second operand 3 states. [2019-09-08 12:20:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:08,212 INFO L93 Difference]: Finished difference Result 40451 states and 59274 transitions. [2019-09-08 12:20:08,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:20:08,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 12:20:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:08,232 INFO L225 Difference]: With dead ends: 40451 [2019-09-08 12:20:08,233 INFO L226 Difference]: Without dead ends: 18145 [2019-09-08 12:20:08,260 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:20:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18145 states. [2019-09-08 12:20:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18145 to 18143. [2019-09-08 12:20:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-09-08 12:20:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 26503 transitions. [2019-09-08 12:20:09,190 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 26503 transitions. Word has length 116 [2019-09-08 12:20:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:09,190 INFO L475 AbstractCegarLoop]: Abstraction has 18143 states and 26503 transitions. [2019-09-08 12:20:09,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:20:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 26503 transitions. [2019-09-08 12:20:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:20:09,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:09,197 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:09,198 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 521539718, now seen corresponding path program 1 times [2019-09-08 12:20:09,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:09,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:20:09,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:09,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:09,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:09,369 INFO L87 Difference]: Start difference. First operand 18143 states and 26503 transitions. Second operand 8 states. [2019-09-08 12:20:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:15,973 INFO L93 Difference]: Finished difference Result 96365 states and 141038 transitions. [2019-09-08 12:20:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:15,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:20:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:16,063 INFO L225 Difference]: With dead ends: 96365 [2019-09-08 12:20:16,063 INFO L226 Difference]: Without dead ends: 90347 [2019-09-08 12:20:16,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:20:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90347 states. [2019-09-08 12:20:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90347 to 30175. [2019-09-08 12:20:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30175 states. [2019-09-08 12:20:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30175 states to 30175 states and 43847 transitions. [2019-09-08 12:20:18,074 INFO L78 Accepts]: Start accepts. Automaton has 30175 states and 43847 transitions. Word has length 117 [2019-09-08 12:20:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:18,074 INFO L475 AbstractCegarLoop]: Abstraction has 30175 states and 43847 transitions. [2019-09-08 12:20:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 30175 states and 43847 transitions. [2019-09-08 12:20:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:20:18,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:18,083 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:18,083 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash -48478900, now seen corresponding path program 1 times [2019-09-08 12:20:18,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:18,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:20:18,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:18,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:18,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:18,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:18,287 INFO L87 Difference]: Start difference. First operand 30175 states and 43847 transitions. Second operand 8 states. [2019-09-08 12:20:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:24,883 INFO L93 Difference]: Finished difference Result 102381 states and 149838 transitions. [2019-09-08 12:20:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:24,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:20:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:24,980 INFO L225 Difference]: With dead ends: 102381 [2019-09-08 12:20:24,980 INFO L226 Difference]: Without dead ends: 96363 [2019-09-08 12:20:25,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:20:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96363 states. [2019-09-08 12:20:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96363 to 36191. [2019-09-08 12:20:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36191 states. [2019-09-08 12:20:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36191 states to 36191 states and 52647 transitions. [2019-09-08 12:20:27,568 INFO L78 Accepts]: Start accepts. Automaton has 36191 states and 52647 transitions. Word has length 117 [2019-09-08 12:20:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:27,568 INFO L475 AbstractCegarLoop]: Abstraction has 36191 states and 52647 transitions. [2019-09-08 12:20:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36191 states and 52647 transitions. [2019-09-08 12:20:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:20:27,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:27,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:27,576 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1639874962, now seen corresponding path program 1 times [2019-09-08 12:20:27,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:27,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:27,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:20:27,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:27,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:27,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:27,764 INFO L87 Difference]: Start difference. First operand 36191 states and 52647 transitions. Second operand 8 states. [2019-09-08 12:20:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:32,637 INFO L93 Difference]: Finished difference Result 96365 states and 140398 transitions. [2019-09-08 12:20:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:32,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:20:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:32,724 INFO L225 Difference]: With dead ends: 96365 [2019-09-08 12:20:32,724 INFO L226 Difference]: Without dead ends: 78315 [2019-09-08 12:20:32,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:20:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78315 states. [2019-09-08 12:20:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78315 to 48223. [2019-09-08 12:20:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48223 states. [2019-09-08 12:20:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48223 states to 48223 states and 69991 transitions. [2019-09-08 12:20:36,138 INFO L78 Accepts]: Start accepts. Automaton has 48223 states and 69991 transitions. Word has length 117 [2019-09-08 12:20:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:36,139 INFO L475 AbstractCegarLoop]: Abstraction has 48223 states and 69991 transitions. [2019-09-08 12:20:36,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48223 states and 69991 transitions. [2019-09-08 12:20:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:20:36,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:36,146 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:36,146 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash -346463388, now seen corresponding path program 1 times [2019-09-08 12:20:36,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:36,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:20:36,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:36,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:36,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:36,333 INFO L87 Difference]: Start difference. First operand 48223 states and 69991 transitions. Second operand 8 states. [2019-09-08 12:20:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:43,117 INFO L93 Difference]: Finished difference Result 108397 states and 157742 transitions. [2019-09-08 12:20:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:43,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:20:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:43,376 INFO L225 Difference]: With dead ends: 108397 [2019-09-08 12:20:43,376 INFO L226 Difference]: Without dead ends: 90347 [2019-09-08 12:20:43,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:20:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90347 states. [2019-09-08 12:20:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90347 to 60255. [2019-09-08 12:20:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60255 states. [2019-09-08 12:20:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60255 states to 60255 states and 87335 transitions. [2019-09-08 12:20:47,685 INFO L78 Accepts]: Start accepts. Automaton has 60255 states and 87335 transitions. Word has length 117 [2019-09-08 12:20:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:47,686 INFO L475 AbstractCegarLoop]: Abstraction has 60255 states and 87335 transitions. [2019-09-08 12:20:47,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 60255 states and 87335 transitions. [2019-09-08 12:20:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:20:47,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:47,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:47,693 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash -370208610, now seen corresponding path program 1 times [2019-09-08 12:20:47,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:47,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:47,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:47,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:47,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:20:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:47,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:47,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:47,863 INFO L87 Difference]: Start difference. First operand 60255 states and 87335 transitions. Second operand 8 states. [2019-09-08 12:20:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:55,892 INFO L93 Difference]: Finished difference Result 120429 states and 175086 transitions. [2019-09-08 12:20:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:55,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:20:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:56,003 INFO L225 Difference]: With dead ends: 120429 [2019-09-08 12:20:56,003 INFO L226 Difference]: Without dead ends: 102379 [2019-09-08 12:20:56,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:20:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102379 states. [2019-09-08 12:21:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102379 to 72287. [2019-09-08 12:21:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72287 states. [2019-09-08 12:21:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72287 states to 72287 states and 104679 transitions. [2019-09-08 12:21:01,437 INFO L78 Accepts]: Start accepts. Automaton has 72287 states and 104679 transitions. Word has length 117 [2019-09-08 12:21:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:01,437 INFO L475 AbstractCegarLoop]: Abstraction has 72287 states and 104679 transitions. [2019-09-08 12:21:01,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:21:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72287 states and 104679 transitions. [2019-09-08 12:21:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:21:01,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:01,444 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:01,445 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -742734504, now seen corresponding path program 1 times [2019-09-08 12:21:01,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:01,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:21:01,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:21:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:02,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:21:02,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:21:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:21:02,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:21:02,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-09-08 12:21:02,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:21:02,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:21:02,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:21:02,249 INFO L87 Difference]: Start difference. First operand 72287 states and 104679 transitions. Second operand 11 states. [2019-09-08 12:21:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:17,887 INFO L93 Difference]: Finished difference Result 204673 states and 298168 transitions. [2019-09-08 12:21:17,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:21:17,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2019-09-08 12:21:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:18,404 INFO L225 Difference]: With dead ends: 204673 [2019-09-08 12:21:18,404 INFO L226 Difference]: Without dead ends: 186623 [2019-09-08 12:21:18,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186623 states. [2019-09-08 12:21:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186623 to 102367. [2019-09-08 12:21:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102367 states. [2019-09-08 12:21:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102367 states to 102367 states and 148807 transitions. [2019-09-08 12:21:31,710 INFO L78 Accepts]: Start accepts. Automaton has 102367 states and 148807 transitions. Word has length 117 [2019-09-08 12:21:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:31,710 INFO L475 AbstractCegarLoop]: Abstraction has 102367 states and 148807 transitions. [2019-09-08 12:21:31,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:21:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 102367 states and 148807 transitions. [2019-09-08 12:21:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:21:31,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:31,729 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:31,729 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1924244045, now seen corresponding path program 1 times [2019-09-08 12:21:31,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:31,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:21:31,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:21:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:21:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:32,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:21:32,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:21:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:21:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:21:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 12:21:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:21:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:21:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:21:32,417 INFO L87 Difference]: Start difference. First operand 102367 states and 148807 transitions. Second operand 12 states. [2019-09-08 12:22:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:49,416 INFO L93 Difference]: Finished difference Result 865267 states and 1240923 transitions. [2019-09-08 12:22:49,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 12:22:49,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-08 12:22:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:50,531 INFO L225 Difference]: With dead ends: 865267 [2019-09-08 12:22:50,531 INFO L226 Difference]: Without dead ends: 762981 [2019-09-08 12:22:50,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=768, Invalid=3264, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 12:22:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762981 states. [2019-09-08 12:23:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762981 to 278086. [2019-09-08 12:23:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278086 states. [2019-09-08 12:23:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278086 states to 278086 states and 392299 transitions. [2019-09-08 12:23:28,333 INFO L78 Accepts]: Start accepts. Automaton has 278086 states and 392299 transitions. Word has length 118 [2019-09-08 12:23:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:28,333 INFO L475 AbstractCegarLoop]: Abstraction has 278086 states and 392299 transitions. [2019-09-08 12:23:28,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:23:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 278086 states and 392299 transitions. [2019-09-08 12:23:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:23:28,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:28,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:28,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 178915903, now seen corresponding path program 1 times [2019-09-08 12:23:28,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:23:28,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:23:28,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:23:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:28,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:23:28,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:23:28,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:23:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:23:29,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:23:29,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:23:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:23:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:23:29,228 INFO L87 Difference]: Start difference. First operand 278086 states and 392299 transitions. Second operand 17 states. [2019-09-08 12:23:42,752 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 12:24:27,144 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 12:24:29,697 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-08 12:24:30,480 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 12:24:30,690 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 12:25:04,102 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49