java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:50:50,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:50:50,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:50:50,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:50:50,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:50:50,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:50:50,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:50:50,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:50:50,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:50:50,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:50:50,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:50:50,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:50:50,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:50:50,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:50:50,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:50:50,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:50:50,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:50:50,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:50:50,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:50:50,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:50:50,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:50:50,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:50:50,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:50:50,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:50:50,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:50:50,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:50:50,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:50:50,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:50:50,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:50:50,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:50:50,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:50:50,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:50:50,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:50:50,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:50:50,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:50:50,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:50:50,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:50:50,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:50:50,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:50:50,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:50:50,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:50:50,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:50:50,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:50:50,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:50:50,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:50:50,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:50:50,951 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:50:50,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:50:50,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:50:50,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:50:50,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:50:50,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:50:50,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:50:50,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:50:50,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:50:50,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:50:50,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:50:50,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:50:50,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:50:50,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:50:50,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:50:50,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:50:50,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:50:50,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:50:50,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:50:50,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:50:50,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:50:50,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:50:50,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:50:50,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:50:50,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:50:50,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:50:51,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:50:51,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:50:51,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:50:51,013 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:50:51,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:50:51,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f614567/ef0d85575d004f8bad2bab4ec1610601/FLAGf377a1910 [2019-10-02 14:50:51,659 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:50:51,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:50:51,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f614567/ef0d85575d004f8bad2bab4ec1610601/FLAGf377a1910 [2019-10-02 14:50:51,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f614567/ef0d85575d004f8bad2bab4ec1610601 [2019-10-02 14:50:51,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:50:51,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:50:51,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:50:51,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:50:51,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:50:51,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:50:51" (1/1) ... [2019-10-02 14:50:51,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce32cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:51, skipping insertion in model container [2019-10-02 14:50:51,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:50:51" (1/1) ... [2019-10-02 14:50:51,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:50:52,049 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:50:52,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:50:52,600 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:50:52,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:50:52,776 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:50:52,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52 WrapperNode [2019-10-02 14:50:52,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:50:52,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:50:52,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:50:52,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:50:52,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... [2019-10-02 14:50:52,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:50:52,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:50:52,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:50:52,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:50:52,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:50:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:50:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:50:52,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:50:52,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:50:52,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:50:52,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 14:50:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:50:52,981 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:50:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:50:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:50:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:50:52,982 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:50:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:50:52,983 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:50:52,984 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:50:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:50:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:50:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:50:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:50:54,540 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:50:54,542 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:50:54,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:50:54 BoogieIcfgContainer [2019-10-02 14:50:54,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:50:54,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:50:54,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:50:54,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:50:54,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:50:51" (1/3) ... [2019-10-02 14:50:54,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce0510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:50:54, skipping insertion in model container [2019-10-02 14:50:54,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:50:52" (2/3) ... [2019-10-02 14:50:54,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce0510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:50:54, skipping insertion in model container [2019-10-02 14:50:54,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:50:54" (3/3) ... [2019-10-02 14:50:54,552 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:50:54,563 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:50:54,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:50:54,591 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:50:54,626 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:50:54,627 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:50:54,627 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:50:54,628 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:50:54,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:50:54,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:50:54,628 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:50:54,629 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:50:54,629 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:50:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-10-02 14:50:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 14:50:54,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:54,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:54,675 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-10-02 14:50:54,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:54,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:54,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:55,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:55,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:55,447 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-10-02 14:50:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:55,718 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-10-02 14:50:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:55,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-02 14:50:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:55,741 INFO L225 Difference]: With dead ends: 641 [2019-10-02 14:50:55,741 INFO L226 Difference]: Without dead ends: 514 [2019-10-02 14:50:55,746 INFO L640 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-10-02 14:50:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-02 14:50:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-02 14:50:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 14:50:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-10-02 14:50:55,852 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-10-02 14:50:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:55,853 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-10-02 14:50:55,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:50:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-10-02 14:50:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 14:50:55,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:55,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:55,859 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-10-02 14:50:55,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:55,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:56,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:56,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:56,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:56,126 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-10-02 14:50:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:56,293 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-10-02 14:50:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:56,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-02 14:50:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:56,306 INFO L225 Difference]: With dead ends: 1076 [2019-10-02 14:50:56,307 INFO L226 Difference]: Without dead ends: 884 [2019-10-02 14:50:56,312 INFO L640 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-10-02 14:50:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-02 14:50:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-10-02 14:50:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-10-02 14:50:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-10-02 14:50:56,389 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-10-02 14:50:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:56,391 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-10-02 14:50:56,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:50:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-10-02 14:50:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 14:50:56,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:56,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:56,400 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-10-02 14:50:56,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:56,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:50:56,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:50:56,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:50:56,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:50:56,880 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-10-02 14:50:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:57,103 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-10-02 14:50:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:50:57,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-02 14:50:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:57,125 INFO L225 Difference]: With dead ends: 2577 [2019-10-02 14:50:57,125 INFO L226 Difference]: Without dead ends: 1708 [2019-10-02 14:50:57,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:50:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-10-02 14:50:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-10-02 14:50:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-10-02 14:50:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-10-02 14:50:57,262 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-10-02 14:50:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:57,263 INFO L475 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-10-02 14:50:57,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:50:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-10-02 14:50:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 14:50:57,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:57,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:57,274 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-10-02 14:50:57,275 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:57,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:57,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:57,387 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-10-02 14:50:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:57,594 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-10-02 14:50:57,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:57,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-02 14:50:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:57,615 INFO L225 Difference]: With dead ends: 5072 [2019-10-02 14:50:57,615 INFO L226 Difference]: Without dead ends: 3398 [2019-10-02 14:50:57,619 INFO L640 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-10-02 14:50:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-02 14:50:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-10-02 14:50:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-10-02 14:50:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-10-02 14:50:57,732 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-10-02 14:50:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:57,732 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-10-02 14:50:57,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:50:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-10-02 14:50:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:50:57,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:57,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:57,737 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-10-02 14:50:57,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:57,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:57,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:57,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:57,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:57,845 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-10-02 14:50:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:58,094 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-10-02 14:50:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:58,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 14:50:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:58,114 INFO L225 Difference]: With dead ends: 4838 [2019-10-02 14:50:58,115 INFO L226 Difference]: Without dead ends: 3310 [2019-10-02 14:50:58,120 INFO L640 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-10-02 14:50:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-10-02 14:50:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-10-02 14:50:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-10-02 14:50:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-10-02 14:50:58,419 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-10-02 14:50:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:58,419 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-10-02 14:50:58,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:50:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-10-02 14:50:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:50:58,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:58,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:58,427 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-10-02 14:50:58,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:58,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:58,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:58,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:50:58,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:50:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:50:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:50:58,603 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-10-02 14:50:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:58,783 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-10-02 14:50:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:50:58,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-02 14:50:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:58,796 INFO L225 Difference]: With dead ends: 5666 [2019-10-02 14:50:58,797 INFO L226 Difference]: Without dead ends: 2528 [2019-10-02 14:50:58,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:50:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-10-02 14:50:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-10-02 14:50:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-10-02 14:50:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-10-02 14:50:58,952 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-10-02 14:50:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:58,952 INFO L475 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-10-02 14:50:58,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:50:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-10-02 14:50:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:50:58,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:58,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:58,958 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-10-02 14:50:58,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:58,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:50:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:50:59,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:50:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:50:59,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:50:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:50:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:50:59,146 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-10-02 14:50:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:59,731 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-10-02 14:50:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:50:59,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 14:50:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:59,761 INFO L225 Difference]: With dead ends: 6812 [2019-10-02 14:50:59,762 INFO L226 Difference]: Without dead ends: 4696 [2019-10-02 14:50:59,773 INFO L640 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-10-02 14:50:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-10-02 14:51:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-10-02 14:51:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-10-02 14:51:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-10-02 14:51:00,072 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-10-02 14:51:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:00,072 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-10-02 14:51:00,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:51:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-10-02 14:51:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:51:00,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:00,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:00,084 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-10-02 14:51:00,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:00,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:00,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:00,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:51:00,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:51:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:51:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:51:00,692 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 15 states. [2019-10-02 14:51:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:03,117 INFO L93 Difference]: Finished difference Result 12388 states and 19102 transitions. [2019-10-02 14:51:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:51:03,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2019-10-02 14:51:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:03,160 INFO L225 Difference]: With dead ends: 12388 [2019-10-02 14:51:03,160 INFO L226 Difference]: Without dead ends: 8416 [2019-10-02 14:51:03,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:51:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-10-02 14:51:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 6432. [2019-10-02 14:51:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-10-02 14:51:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9844 transitions. [2019-10-02 14:51:03,644 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9844 transitions. Word has length 158 [2019-10-02 14:51:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:03,645 INFO L475 AbstractCegarLoop]: Abstraction has 6432 states and 9844 transitions. [2019-10-02 14:51:03,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:51:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9844 transitions. [2019-10-02 14:51:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:51:03,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:03,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:03,653 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:03,653 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-10-02 14:51:03,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:03,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:51:03,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:51:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:51:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:51:03,958 INFO L87 Difference]: Start difference. First operand 6432 states and 9844 transitions. Second operand 9 states. [2019-10-02 14:51:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:04,739 INFO L93 Difference]: Finished difference Result 13818 states and 21476 transitions. [2019-10-02 14:51:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:51:04,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 14:51:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:04,762 INFO L225 Difference]: With dead ends: 13818 [2019-10-02 14:51:04,763 INFO L226 Difference]: Without dead ends: 9628 [2019-10-02 14:51:04,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:51:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2019-10-02 14:51:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 7796. [2019-10-02 14:51:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-10-02 14:51:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-10-02 14:51:05,164 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-10-02 14:51:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:05,165 INFO L475 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-10-02 14:51:05,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:51:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-10-02 14:51:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:51:05,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:05,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:05,176 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-10-02 14:51:05,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:05,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:05,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:05,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:51:05,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:51:05,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:51:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:05,391 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 5 states. [2019-10-02 14:51:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:06,425 INFO L93 Difference]: Finished difference Result 16045 states and 25162 transitions. [2019-10-02 14:51:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:51:06,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-02 14:51:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:06,460 INFO L225 Difference]: With dead ends: 16045 [2019-10-02 14:51:06,460 INFO L226 Difference]: Without dead ends: 14207 [2019-10-02 14:51:06,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2019-10-02 14:51:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 10541. [2019-10-02 14:51:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2019-10-02 14:51:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 16098 transitions. [2019-10-02 14:51:07,574 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 16098 transitions. Word has length 158 [2019-10-02 14:51:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:07,575 INFO L475 AbstractCegarLoop]: Abstraction has 10541 states and 16098 transitions. [2019-10-02 14:51:07,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:51:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 16098 transitions. [2019-10-02 14:51:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:51:07,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:07,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:07,586 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1963094895, now seen corresponding path program 1 times [2019-10-02 14:51:07,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:07,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:51:07,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:51:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:51:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:51:07,788 INFO L87 Difference]: Start difference. First operand 10541 states and 16098 transitions. Second operand 4 states. [2019-10-02 14:51:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:08,831 INFO L93 Difference]: Finished difference Result 27660 states and 42237 transitions. [2019-10-02 14:51:08,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:51:08,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-02 14:51:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:08,869 INFO L225 Difference]: With dead ends: 27660 [2019-10-02 14:51:08,869 INFO L226 Difference]: Without dead ends: 17128 [2019-10-02 14:51:08,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-10-02 14:51:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17126. [2019-10-02 14:51:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-10-02 14:51:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 25905 transitions. [2019-10-02 14:51:09,874 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 25905 transitions. Word has length 158 [2019-10-02 14:51:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:09,874 INFO L475 AbstractCegarLoop]: Abstraction has 17126 states and 25905 transitions. [2019-10-02 14:51:09,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:51:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 25905 transitions. [2019-10-02 14:51:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:51:09,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:09,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:09,892 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1251669041, now seen corresponding path program 1 times [2019-10-02 14:51:09,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:09,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:10,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:10,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:51:10,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:51:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:51:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:51:10,003 INFO L87 Difference]: Start difference. First operand 17126 states and 25905 transitions. Second operand 3 states. [2019-10-02 14:51:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:11,265 INFO L93 Difference]: Finished difference Result 46538 states and 70297 transitions. [2019-10-02 14:51:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:51:11,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-02 14:51:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:11,315 INFO L225 Difference]: With dead ends: 46538 [2019-10-02 14:51:11,315 INFO L226 Difference]: Without dead ends: 29773 [2019-10-02 14:51:11,343 INFO L640 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-10-02 14:51:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29773 states. [2019-10-02 14:51:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 29771. [2019-10-02 14:51:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29771 states. [2019-10-02 14:51:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29771 states to 29771 states and 44403 transitions. [2019-10-02 14:51:13,329 INFO L78 Accepts]: Start accepts. Automaton has 29771 states and 44403 transitions. Word has length 160 [2019-10-02 14:51:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:13,329 INFO L475 AbstractCegarLoop]: Abstraction has 29771 states and 44403 transitions. [2019-10-02 14:51:13,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:51:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 29771 states and 44403 transitions. [2019-10-02 14:51:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:51:13,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:13,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:13,350 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:13,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash -488936532, now seen corresponding path program 1 times [2019-10-02 14:51:13,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:13,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:13,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:13,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:13,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:51:13,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:51:13,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:51:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:51:13,487 INFO L87 Difference]: Start difference. First operand 29771 states and 44403 transitions. Second operand 4 states. [2019-10-02 14:51:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:14,833 INFO L93 Difference]: Finished difference Result 49776 states and 74234 transitions. [2019-10-02 14:51:14,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:51:14,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-02 14:51:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:14,869 INFO L225 Difference]: With dead ends: 49776 [2019-10-02 14:51:14,869 INFO L226 Difference]: Without dead ends: 26850 [2019-10-02 14:51:14,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26850 states. [2019-10-02 14:51:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26850 to 26850. [2019-10-02 14:51:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-10-02 14:51:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 40034 transitions. [2019-10-02 14:51:16,263 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 40034 transitions. Word has length 160 [2019-10-02 14:51:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:16,264 INFO L475 AbstractCegarLoop]: Abstraction has 26850 states and 40034 transitions. [2019-10-02 14:51:16,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:51:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 40034 transitions. [2019-10-02 14:51:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:51:16,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:16,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:16,282 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1120267668, now seen corresponding path program 1 times [2019-10-02 14:51:16,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:16,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:16,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:16,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:16,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:51:16,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:51:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:51:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:51:16,404 INFO L87 Difference]: Start difference. First operand 26850 states and 40034 transitions. Second operand 3 states. [2019-10-02 14:51:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:18,692 INFO L93 Difference]: Finished difference Result 51482 states and 79000 transitions. [2019-10-02 14:51:18,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:51:18,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 14:51:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:18,731 INFO L225 Difference]: With dead ends: 51482 [2019-10-02 14:51:18,731 INFO L226 Difference]: Without dead ends: 35028 [2019-10-02 14:51:18,749 INFO L640 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-10-02 14:51:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2019-10-02 14:51:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 32518. [2019-10-02 14:51:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32518 states. [2019-10-02 14:51:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32518 states to 32518 states and 48470 transitions. [2019-10-02 14:51:20,334 INFO L78 Accepts]: Start accepts. Automaton has 32518 states and 48470 transitions. Word has length 166 [2019-10-02 14:51:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:20,335 INFO L475 AbstractCegarLoop]: Abstraction has 32518 states and 48470 transitions. [2019-10-02 14:51:20,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:51:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 32518 states and 48470 transitions. [2019-10-02 14:51:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:51:20,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:20,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:20,347 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1417380321, now seen corresponding path program 1 times [2019-10-02 14:51:20,348 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:20,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:20,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:20,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:51:20,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:51:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:51:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:20,521 INFO L87 Difference]: Start difference. First operand 32518 states and 48470 transitions. Second operand 5 states. [2019-10-02 14:51:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:23,409 INFO L93 Difference]: Finished difference Result 74926 states and 115502 transitions. [2019-10-02 14:51:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:51:23,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-10-02 14:51:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:23,480 INFO L225 Difference]: With dead ends: 74926 [2019-10-02 14:51:23,481 INFO L226 Difference]: Without dead ends: 57596 [2019-10-02 14:51:23,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:51:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57596 states. [2019-10-02 14:51:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57596 to 34850. [2019-10-02 14:51:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34850 states. [2019-10-02 14:51:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34850 states to 34850 states and 52226 transitions. [2019-10-02 14:51:26,271 INFO L78 Accepts]: Start accepts. Automaton has 34850 states and 52226 transitions. Word has length 166 [2019-10-02 14:51:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:26,271 INFO L475 AbstractCegarLoop]: Abstraction has 34850 states and 52226 transitions. [2019-10-02 14:51:26,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:51:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 34850 states and 52226 transitions. [2019-10-02 14:51:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:51:26,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:26,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:26,283 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:26,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1681876025, now seen corresponding path program 1 times [2019-10-02 14:51:26,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:26,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:26,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:26,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:26,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:51:26,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:51:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:51:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:51:26,511 INFO L87 Difference]: Start difference. First operand 34850 states and 52226 transitions. Second operand 8 states. [2019-10-02 14:51:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:30,722 INFO L93 Difference]: Finished difference Result 90834 states and 139934 transitions. [2019-10-02 14:51:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:51:30,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-02 14:51:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:30,805 INFO L225 Difference]: With dead ends: 90834 [2019-10-02 14:51:30,805 INFO L226 Difference]: Without dead ends: 67944 [2019-10-02 14:51:30,837 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:51:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67944 states. [2019-10-02 14:51:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67944 to 64706. [2019-10-02 14:51:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64706 states. [2019-10-02 14:51:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64706 states to 64706 states and 98590 transitions. [2019-10-02 14:51:35,717 INFO L78 Accepts]: Start accepts. Automaton has 64706 states and 98590 transitions. Word has length 166 [2019-10-02 14:51:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:35,717 INFO L475 AbstractCegarLoop]: Abstraction has 64706 states and 98590 transitions. [2019-10-02 14:51:35,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:51:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 64706 states and 98590 transitions. [2019-10-02 14:51:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:51:35,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:35,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:35,728 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -479850760, now seen corresponding path program 1 times [2019-10-02 14:51:35,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:35,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:35,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:35,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:35,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:51:35,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:51:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:51:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:51:35,927 INFO L87 Difference]: Start difference. First operand 64706 states and 98590 transitions. Second operand 4 states. [2019-10-02 14:51:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:51:44,986 INFO L93 Difference]: Finished difference Result 189438 states and 288303 transitions. [2019-10-02 14:51:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:51:44,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-02 14:51:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:51:45,156 INFO L225 Difference]: With dead ends: 189438 [2019-10-02 14:51:45,157 INFO L226 Difference]: Without dead ends: 124775 [2019-10-02 14:51:45,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:51:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124775 states. [2019-10-02 14:51:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124775 to 124773. [2019-10-02 14:51:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124773 states. [2019-10-02 14:51:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124773 states to 124773 states and 187960 transitions. [2019-10-02 14:51:54,817 INFO L78 Accepts]: Start accepts. Automaton has 124773 states and 187960 transitions. Word has length 166 [2019-10-02 14:51:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:51:54,817 INFO L475 AbstractCegarLoop]: Abstraction has 124773 states and 187960 transitions. [2019-10-02 14:51:54,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:51:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 124773 states and 187960 transitions. [2019-10-02 14:51:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:51:54,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:51:54,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:51:54,837 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:51:54,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:51:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1030531842, now seen corresponding path program 1 times [2019-10-02 14:51:54,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:51:54,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:51:54,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:54,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:51:54,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:51:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:51:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:51:54,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:51:54,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:51:54,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:51:54,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:51:54,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:51:54,910 INFO L87 Difference]: Start difference. First operand 124773 states and 187960 transitions. Second operand 3 states. [2019-10-02 14:52:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:09,707 INFO L93 Difference]: Finished difference Result 374127 states and 563633 transitions. [2019-10-02 14:52:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:52:09,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 14:52:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:10,063 INFO L225 Difference]: With dead ends: 374127 [2019-10-02 14:52:10,063 INFO L226 Difference]: Without dead ends: 249459 [2019-10-02 14:52:10,167 INFO L640 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-10-02 14:52:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249459 states. [2019-10-02 14:52:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249459 to 124779. [2019-10-02 14:52:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124779 states. [2019-10-02 14:52:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124779 states to 124779 states and 187966 transitions. [2019-10-02 14:52:22,692 INFO L78 Accepts]: Start accepts. Automaton has 124779 states and 187966 transitions. Word has length 167 [2019-10-02 14:52:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:22,692 INFO L475 AbstractCegarLoop]: Abstraction has 124779 states and 187966 transitions. [2019-10-02 14:52:22,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:52:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 124779 states and 187966 transitions. [2019-10-02 14:52:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:52:22,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:22,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:22,717 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash -430087111, now seen corresponding path program 1 times [2019-10-02 14:52:22,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:22,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:22,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:52:22,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:52:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:52:22,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:52:22,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:52:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:52:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:52:22,837 INFO L87 Difference]: Start difference. First operand 124779 states and 187966 transitions. Second operand 4 states. [2019-10-02 14:52:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:31,769 INFO L93 Difference]: Finished difference Result 249516 states and 375876 transitions. [2019-10-02 14:52:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:52:31,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 14:52:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:31,951 INFO L225 Difference]: With dead ends: 249516 [2019-10-02 14:52:31,951 INFO L226 Difference]: Without dead ends: 124773 [2019-10-02 14:52:32,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:52:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124773 states. [2019-10-02 14:52:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124773 to 124773. [2019-10-02 14:52:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124773 states. [2019-10-02 14:52:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124773 states to 124773 states and 187954 transitions. [2019-10-02 14:52:43,324 INFO L78 Accepts]: Start accepts. Automaton has 124773 states and 187954 transitions. Word has length 168 [2019-10-02 14:52:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:43,324 INFO L475 AbstractCegarLoop]: Abstraction has 124773 states and 187954 transitions. [2019-10-02 14:52:43,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:52:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 124773 states and 187954 transitions. [2019-10-02 14:52:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:52:43,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:43,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:43,349 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 590295178, now seen corresponding path program 1 times [2019-10-02 14:52:43,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:52:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:52:43,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:52:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:52:43,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:52:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:52:43,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:52:43,441 INFO L87 Difference]: Start difference. First operand 124773 states and 187954 transitions. Second operand 3 states. [2019-10-02 14:52:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:59,168 INFO L93 Difference]: Finished difference Result 309963 states and 465985 transitions. [2019-10-02 14:52:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:52:59,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:52:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:59,415 INFO L225 Difference]: With dead ends: 309963 [2019-10-02 14:52:59,415 INFO L226 Difference]: Without dead ends: 185865 [2019-10-02 14:52:59,500 INFO L640 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-10-02 14:52:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185865 states. [2019-10-02 14:53:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185865 to 185863. [2019-10-02 14:53:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185863 states. [2019-10-02 14:53:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185863 states to 185863 states and 275701 transitions. [2019-10-02 14:53:13,151 INFO L78 Accepts]: Start accepts. Automaton has 185863 states and 275701 transitions. Word has length 168 [2019-10-02 14:53:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:13,152 INFO L475 AbstractCegarLoop]: Abstraction has 185863 states and 275701 transitions. [2019-10-02 14:53:13,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:53:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 185863 states and 275701 transitions. [2019-10-02 14:53:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:53:13,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:13,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:53:13,180 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 938171426, now seen corresponding path program 1 times [2019-10-02 14:53:13,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:53:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:53:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:53:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:53:13,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:53:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:53:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:53:13,256 INFO L87 Difference]: Start difference. First operand 185863 states and 275701 transitions. Second operand 3 states. [2019-10-02 14:53:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:53:34,535 INFO L93 Difference]: Finished difference Result 421445 states and 635875 transitions. [2019-10-02 14:53:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:53:34,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 14:53:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:53:35,087 INFO L225 Difference]: With dead ends: 421445 [2019-10-02 14:53:35,087 INFO L226 Difference]: Without dead ends: 263974 [2019-10-02 14:53:35,295 INFO L640 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-10-02 14:53:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263974 states. [2019-10-02 14:53:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263974 to 224682. [2019-10-02 14:53:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224682 states. [2019-10-02 14:53:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224682 states to 224682 states and 335116 transitions. [2019-10-02 14:53:57,123 INFO L78 Accepts]: Start accepts. Automaton has 224682 states and 335116 transitions. Word has length 174 [2019-10-02 14:53:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:53:57,124 INFO L475 AbstractCegarLoop]: Abstraction has 224682 states and 335116 transitions. [2019-10-02 14:53:57,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:53:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 224682 states and 335116 transitions. [2019-10-02 14:53:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:53:57,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:53:57,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:53:57,153 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:53:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:53:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1722974211, now seen corresponding path program 1 times [2019-10-02 14:53:57,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:53:57,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:53:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:53:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:53:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:53:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:53:57,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:53:57,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:53:57,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:53:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:53:57,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:53:57,403 INFO L87 Difference]: Start difference. First operand 224682 states and 335116 transitions. Second operand 10 states. [2019-10-02 14:54:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:54:17,316 INFO L93 Difference]: Finished difference Result 424378 states and 632679 transitions. [2019-10-02 14:54:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:54:17,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-10-02 14:54:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:54:17,646 INFO L225 Difference]: With dead ends: 424378 [2019-10-02 14:54:17,646 INFO L226 Difference]: Without dead ends: 224682 [2019-10-02 14:54:17,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:54:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224682 states. [2019-10-02 14:54:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224682 to 224682. [2019-10-02 14:54:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224682 states. [2019-10-02 14:54:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224682 states to 224682 states and 330754 transitions. [2019-10-02 14:54:40,874 INFO L78 Accepts]: Start accepts. Automaton has 224682 states and 330754 transitions. Word has length 174 [2019-10-02 14:54:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:54:40,875 INFO L475 AbstractCegarLoop]: Abstraction has 224682 states and 330754 transitions. [2019-10-02 14:54:40,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:54:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 224682 states and 330754 transitions. [2019-10-02 14:54:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:54:40,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:54:40,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:54:40,902 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:54:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:54:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1960603682, now seen corresponding path program 1 times [2019-10-02 14:54:40,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:54:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:54:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:54:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:54:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:54:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:54:41,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:54:41,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:54:41,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:54:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:54:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:54:41,055 INFO L87 Difference]: Start difference. First operand 224682 states and 330754 transitions. Second operand 5 states. [2019-10-02 14:55:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:30,716 INFO L93 Difference]: Finished difference Result 745852 states and 1125693 transitions. [2019-10-02 14:55:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:55:30,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-02 14:55:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:31,681 INFO L225 Difference]: With dead ends: 745852 [2019-10-02 14:55:31,681 INFO L226 Difference]: Without dead ends: 566038 [2019-10-02 14:55:31,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:55:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566038 states. [2019-10-02 14:56:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566038 to 542206. [2019-10-02 14:56:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542206 states. [2019-10-02 14:56:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542206 states to 542206 states and 815148 transitions. [2019-10-02 14:56:32,056 INFO L78 Accepts]: Start accepts. Automaton has 542206 states and 815148 transitions. Word has length 174 [2019-10-02 14:56:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:32,056 INFO L475 AbstractCegarLoop]: Abstraction has 542206 states and 815148 transitions. [2019-10-02 14:56:32,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 542206 states and 815148 transitions. [2019-10-02 14:56:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:56:32,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:32,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:32,086 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash 63372601, now seen corresponding path program 1 times [2019-10-02 14:56:32,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:32,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:33,511 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-10-02 14:56:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:33,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:33,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 14:56:33,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:56:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:56:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:56:33,984 INFO L87 Difference]: Start difference. First operand 542206 states and 815148 transitions. Second operand 21 states. [2019-10-02 14:56:34,152 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-02 14:59:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:17,216 INFO L93 Difference]: Finished difference Result 1528797 states and 2277383 transitions. [2019-10-02 14:59:17,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:59:17,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 174 [2019-10-02 14:59:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:19,573 INFO L225 Difference]: With dead ends: 1528797 [2019-10-02 14:59:19,573 INFO L226 Difference]: Without dead ends: 1442167 [2019-10-02 14:59:19,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=683, Invalid=1573, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:59:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442167 states. [2019-10-02 15:01:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442167 to 676018. [2019-10-02 15:01:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676018 states. [2019-10-02 15:01:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676018 states to 676018 states and 1015343 transitions. [2019-10-02 15:01:03,064 INFO L78 Accepts]: Start accepts. Automaton has 676018 states and 1015343 transitions. Word has length 174 [2019-10-02 15:01:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:03,065 INFO L475 AbstractCegarLoop]: Abstraction has 676018 states and 1015343 transitions. [2019-10-02 15:01:03,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 15:01:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 676018 states and 1015343 transitions. [2019-10-02 15:01:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 15:01:03,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:03,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:03,102 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1891624545, now seen corresponding path program 1 times [2019-10-02 15:01:03,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:03,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:03,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:03,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 15:01:03,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 15:01:03,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 15:01:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 15:01:03,491 INFO L87 Difference]: Start difference. First operand 676018 states and 1015343 transitions. Second operand 16 states.