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/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:19:39,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:19:39,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:19:39,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:19:39,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:19:39,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:19:39,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:19:39,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:19:39,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:19:39,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:19:39,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:19:39,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:19:39,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:19:39,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:19:39,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:19:39,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:19:39,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:19:39,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:19:39,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:19:39,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:19:39,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:19:39,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:19:39,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:19:39,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:19:39,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:19:39,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:19:39,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:19:39,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:19:39,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:19:39,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:19:39,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:19:39,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:19:39,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:19:39,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:19:39,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:19:39,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:19:39,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:19:39,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:19:39,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:19:39,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:19:39,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:19:39,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 07:19:39,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:19:39,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:19:39,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:19:39,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:19:39,960 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:19:39,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:19:39,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:19:39,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:19:39,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:19:39,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:19:39,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:19:39,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:19:39,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:19:39,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:19:39,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:19:39,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:19:39,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:19:39,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:19:39,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:19:39,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:19:39,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:19:39,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:19:39,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:19:39,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:19:39,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:19:39,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:19:39,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:19:39,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:19:39,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:19:39,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:19:40,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:19:40,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:19:40,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:19:40,025 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:19:40,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 07:19:40,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e586985d/b49d10bb113f4600a4efa19027d23587/FLAG6d09e3abb [2019-09-08 07:19:40,678 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:19:40,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 07:19:40,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e586985d/b49d10bb113f4600a4efa19027d23587/FLAG6d09e3abb [2019-09-08 07:19:40,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e586985d/b49d10bb113f4600a4efa19027d23587 [2019-09-08 07:19:40,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:19:40,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:19:40,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:19:40,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:19:40,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:19:40,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:19:40" (1/1) ... [2019-09-08 07:19:40,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258a43cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:40, skipping insertion in model container [2019-09-08 07:19:40,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:19:40" (1/1) ... [2019-09-08 07:19:40,947 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:19:41,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:19:41,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:19:41,464 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:19:41,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:19:41,583 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:19:41,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41 WrapperNode [2019-09-08 07:19:41,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:19:41,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:19:41,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:19:41,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:19:41,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... [2019-09-08 07:19:41,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:19:41,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:19:41,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:19:41,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:19:41,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:19:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:19:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:19:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:19:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:19:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:19:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:19:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:19:41,806 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:19:41,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:19:41,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:19:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:19:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:19:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:19:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:19:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:19:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:19:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:19:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:19:41,814 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:19:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:19:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:19:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:19:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:19:41,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:19:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:19:41,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:19:43,211 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:19:43,212 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:19:43,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:19:43 BoogieIcfgContainer [2019-09-08 07:19:43,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:19:43,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:19:43,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:19:43,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:19:43,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:19:40" (1/3) ... [2019-09-08 07:19:43,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfa9d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:19:43, skipping insertion in model container [2019-09-08 07:19:43,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:19:41" (2/3) ... [2019-09-08 07:19:43,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfa9d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:19:43, skipping insertion in model container [2019-09-08 07:19:43,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:19:43" (3/3) ... [2019-09-08 07:19:43,225 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c [2019-09-08 07:19:43,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:19:43,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:19:43,268 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:19:43,332 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:19:43,333 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:19:43,334 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:19:43,334 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:19:43,334 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:19:43,335 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:19:43,335 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:19:43,335 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:19:43,335 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:19:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-09-08 07:19:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 07:19:43,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:43,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:43,418 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:43,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash -772559481, now seen corresponding path program 1 times [2019-09-08 07:19:43,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:43,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:44,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:44,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:44,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:44,100 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 5 states. [2019-09-08 07:19:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:44,284 INFO L93 Difference]: Finished difference Result 462 states and 783 transitions. [2019-09-08 07:19:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:19:44,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 07:19:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:44,315 INFO L225 Difference]: With dead ends: 462 [2019-09-08 07:19:44,315 INFO L226 Difference]: Without dead ends: 323 [2019-09-08 07:19:44,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:19:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-08 07:19:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-09-08 07:19:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-08 07:19:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 520 transitions. [2019-09-08 07:19:44,416 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 520 transitions. Word has length 98 [2019-09-08 07:19:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:44,417 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 520 transitions. [2019-09-08 07:19:44,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:19:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 520 transitions. [2019-09-08 07:19:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:19:44,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:44,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:44,429 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1532894247, now seen corresponding path program 1 times [2019-09-08 07:19:44,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:44,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:44,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:44,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:44,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:44,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:44,702 INFO L87 Difference]: Start difference. First operand 323 states and 520 transitions. Second operand 5 states. [2019-09-08 07:19:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:46,015 INFO L93 Difference]: Finished difference Result 573 states and 921 transitions. [2019-09-08 07:19:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:19:46,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 07:19:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:46,022 INFO L225 Difference]: With dead ends: 573 [2019-09-08 07:19:46,023 INFO L226 Difference]: Without dead ends: 448 [2019-09-08 07:19:46,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:19:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-08 07:19:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2019-09-08 07:19:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 07:19:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 701 transitions. [2019-09-08 07:19:46,061 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 701 transitions. Word has length 139 [2019-09-08 07:19:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 701 transitions. [2019-09-08 07:19:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:19:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 701 transitions. [2019-09-08 07:19:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 07:19:46,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:46,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:46,066 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1125729132, now seen corresponding path program 1 times [2019-09-08 07:19:46,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:46,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:46,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:46,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:46,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:46,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:46,220 INFO L87 Difference]: Start difference. First operand 440 states and 701 transitions. Second operand 5 states. [2019-09-08 07:19:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:47,361 INFO L93 Difference]: Finished difference Result 916 states and 1447 transitions. [2019-09-08 07:19:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:19:47,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-08 07:19:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:47,367 INFO L225 Difference]: With dead ends: 916 [2019-09-08 07:19:47,368 INFO L226 Difference]: Without dead ends: 674 [2019-09-08 07:19:47,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:19:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-08 07:19:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 666. [2019-09-08 07:19:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 07:19:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1053 transitions. [2019-09-08 07:19:47,414 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1053 transitions. Word has length 142 [2019-09-08 07:19:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:47,415 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1053 transitions. [2019-09-08 07:19:47,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:19:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1053 transitions. [2019-09-08 07:19:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:19:47,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:47,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:47,419 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2099911033, now seen corresponding path program 1 times [2019-09-08 07:19:47,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:47,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:47,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:47,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:47,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:47,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:47,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:47,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:47,601 INFO L87 Difference]: Start difference. First operand 666 states and 1053 transitions. Second operand 5 states. [2019-09-08 07:19:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:48,632 INFO L93 Difference]: Finished difference Result 1586 states and 2483 transitions. [2019-09-08 07:19:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:19:48,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 07:19:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:48,641 INFO L225 Difference]: With dead ends: 1586 [2019-09-08 07:19:48,641 INFO L226 Difference]: Without dead ends: 1118 [2019-09-08 07:19:48,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:19:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-09-08 07:19:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1104. [2019-09-08 07:19:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-08 07:19:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1727 transitions. [2019-09-08 07:19:48,710 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1727 transitions. Word has length 145 [2019-09-08 07:19:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:48,711 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1727 transitions. [2019-09-08 07:19:48,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:19:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1727 transitions. [2019-09-08 07:19:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 07:19:48,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:48,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:48,716 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 624307774, now seen corresponding path program 1 times [2019-09-08 07:19:48,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:48,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:48,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:48,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-09-08 07:19:48,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:48,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:19:48,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:19:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:19:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:19:48,910 INFO L87 Difference]: Start difference. First operand 1104 states and 1727 transitions. Second operand 5 states. [2019-09-08 07:19:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:50,070 INFO L93 Difference]: Finished difference Result 2884 states and 4465 transitions. [2019-09-08 07:19:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:19:50,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-08 07:19:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:50,087 INFO L225 Difference]: With dead ends: 2884 [2019-09-08 07:19:50,087 INFO L226 Difference]: Without dead ends: 1978 [2019-09-08 07:19:50,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:19:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-09-08 07:19:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1952. [2019-09-08 07:19:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 07:19:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3015 transitions. [2019-09-08 07:19:50,217 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3015 transitions. Word has length 148 [2019-09-08 07:19:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:50,218 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3015 transitions. [2019-09-08 07:19:50,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:19:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3015 transitions. [2019-09-08 07:19:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 07:19:50,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:50,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:50,224 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1208811063, now seen corresponding path program 1 times [2019-09-08 07:19:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:50,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:50,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:50,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:19:50,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:19:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:19:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:19:50,651 INFO L87 Difference]: Start difference. First operand 1952 states and 3015 transitions. Second operand 11 states. [2019-09-08 07:19:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:19:57,171 INFO L93 Difference]: Finished difference Result 9057 states and 14558 transitions. [2019-09-08 07:19:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 07:19:57,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 07:19:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:19:57,219 INFO L225 Difference]: With dead ends: 9057 [2019-09-08 07:19:57,219 INFO L226 Difference]: Without dead ends: 7303 [2019-09-08 07:19:57,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:19:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2019-09-08 07:19:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 5697. [2019-09-08 07:19:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-09-08 07:19:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 8881 transitions. [2019-09-08 07:19:57,548 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 8881 transitions. Word has length 151 [2019-09-08 07:19:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:19:57,549 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 8881 transitions. [2019-09-08 07:19:57,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:19:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 8881 transitions. [2019-09-08 07:19:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:19:57,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:19:57,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:19:57,560 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:19:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:19:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1694170578, now seen corresponding path program 1 times [2019-09-08 07:19:57,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:19:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:19:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:19:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:19:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:19:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:19:57,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:19:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:19:57,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:19:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:19:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:19:57,885 INFO L87 Difference]: Start difference. First operand 5697 states and 8881 transitions. Second operand 11 states. [2019-09-08 07:20:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:03,825 INFO L93 Difference]: Finished difference Result 9932 states and 15717 transitions. [2019-09-08 07:20:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 07:20:03,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:03,892 INFO L225 Difference]: With dead ends: 9932 [2019-09-08 07:20:03,892 INFO L226 Difference]: Without dead ends: 8982 [2019-09-08 07:20:03,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:20:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8982 states. [2019-09-08 07:20:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8982 to 7588. [2019-09-08 07:20:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7588 states. [2019-09-08 07:20:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 11863 transitions. [2019-09-08 07:20:04,403 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 11863 transitions. Word has length 152 [2019-09-08 07:20:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:04,404 INFO L475 AbstractCegarLoop]: Abstraction has 7588 states and 11863 transitions. [2019-09-08 07:20:04,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 11863 transitions. [2019-09-08 07:20:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:04,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:04,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:04,416 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1747849298, now seen corresponding path program 1 times [2019-09-08 07:20:04,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:04,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:04,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:04,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:04,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:20:04,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:20:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:20:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:04,609 INFO L87 Difference]: Start difference. First operand 7588 states and 11863 transitions. Second operand 6 states. [2019-09-08 07:20:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:06,983 INFO L93 Difference]: Finished difference Result 22274 states and 34940 transitions. [2019-09-08 07:20:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:20:06,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 07:20:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:07,064 INFO L225 Difference]: With dead ends: 22274 [2019-09-08 07:20:07,064 INFO L226 Difference]: Without dead ends: 14884 [2019-09-08 07:20:07,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:20:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14884 states. [2019-09-08 07:20:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14884 to 14752. [2019-09-08 07:20:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14752 states. [2019-09-08 07:20:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14752 states to 14752 states and 23047 transitions. [2019-09-08 07:20:07,762 INFO L78 Accepts]: Start accepts. Automaton has 14752 states and 23047 transitions. Word has length 152 [2019-09-08 07:20:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:07,763 INFO L475 AbstractCegarLoop]: Abstraction has 14752 states and 23047 transitions. [2019-09-08 07:20:07,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:20:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 14752 states and 23047 transitions. [2019-09-08 07:20:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:07,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:07,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:07,775 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash -963136192, now seen corresponding path program 1 times [2019-09-08 07:20:07,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:08,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:08,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:08,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:08,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:08,035 INFO L87 Difference]: Start difference. First operand 14752 states and 23047 transitions. Second operand 11 states. [2019-09-08 07:20:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:14,811 INFO L93 Difference]: Finished difference Result 30288 states and 47716 transitions. [2019-09-08 07:20:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 07:20:14,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:14,922 INFO L225 Difference]: With dead ends: 30288 [2019-09-08 07:20:14,922 INFO L226 Difference]: Without dead ends: 22750 [2019-09-08 07:20:14,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=612, Invalid=2468, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 07:20:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22750 states. [2019-09-08 07:20:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22750 to 22342. [2019-09-08 07:20:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22342 states. [2019-09-08 07:20:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22342 states to 22342 states and 35115 transitions. [2019-09-08 07:20:16,441 INFO L78 Accepts]: Start accepts. Automaton has 22342 states and 35115 transitions. Word has length 152 [2019-09-08 07:20:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:16,441 INFO L475 AbstractCegarLoop]: Abstraction has 22342 states and 35115 transitions. [2019-09-08 07:20:16,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 22342 states and 35115 transitions. [2019-09-08 07:20:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:16,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:16,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:16,455 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -106267540, now seen corresponding path program 1 times [2019-09-08 07:20:16,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:16,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:16,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:16,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:16,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:16,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:16,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:16,694 INFO L87 Difference]: Start difference. First operand 22342 states and 35115 transitions. Second operand 11 states. [2019-09-08 07:20:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:24,008 INFO L93 Difference]: Finished difference Result 38778 states and 61072 transitions. [2019-09-08 07:20:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 07:20:24,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:24,127 INFO L225 Difference]: With dead ends: 38778 [2019-09-08 07:20:24,127 INFO L226 Difference]: Without dead ends: 30103 [2019-09-08 07:20:24,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 07:20:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30103 states. [2019-09-08 07:20:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30103 to 29867. [2019-09-08 07:20:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29867 states. [2019-09-08 07:20:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29867 states to 29867 states and 47115 transitions. [2019-09-08 07:20:25,073 INFO L78 Accepts]: Start accepts. Automaton has 29867 states and 47115 transitions. Word has length 152 [2019-09-08 07:20:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:25,074 INFO L475 AbstractCegarLoop]: Abstraction has 29867 states and 47115 transitions. [2019-09-08 07:20:25,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29867 states and 47115 transitions. [2019-09-08 07:20:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:25,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:25,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:25,087 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1311271810, now seen corresponding path program 1 times [2019-09-08 07:20:25,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:25,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:25,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:25,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:25,346 INFO L87 Difference]: Start difference. First operand 29867 states and 47115 transitions. Second operand 11 states. [2019-09-08 07:20:33,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:33,751 INFO L93 Difference]: Finished difference Result 45418 states and 71750 transitions. [2019-09-08 07:20:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:20:33,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:33,882 INFO L225 Difference]: With dead ends: 45418 [2019-09-08 07:20:33,882 INFO L226 Difference]: Without dead ends: 34589 [2019-09-08 07:20:33,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 07:20:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34589 states. [2019-09-08 07:20:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34589 to 34473. [2019-09-08 07:20:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-09-08 07:20:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 54441 transitions. [2019-09-08 07:20:35,297 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 54441 transitions. Word has length 152 [2019-09-08 07:20:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:35,297 INFO L475 AbstractCegarLoop]: Abstraction has 34473 states and 54441 transitions. [2019-09-08 07:20:35,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 54441 transitions. [2019-09-08 07:20:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:20:35,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:35,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:35,310 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1859704533, now seen corresponding path program 1 times [2019-09-08 07:20:35,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:35,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:20:35,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:20:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:20:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:35,466 INFO L87 Difference]: Start difference. First operand 34473 states and 54441 transitions. Second operand 7 states. [2019-09-08 07:20:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:38,971 INFO L93 Difference]: Finished difference Result 61815 states and 98059 transitions. [2019-09-08 07:20:38,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:20:38,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-08 07:20:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:39,104 INFO L225 Difference]: With dead ends: 61815 [2019-09-08 07:20:39,104 INFO L226 Difference]: Without dead ends: 37360 [2019-09-08 07:20:39,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:20:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37360 states. [2019-09-08 07:20:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37360 to 29793. [2019-09-08 07:20:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29793 states. [2019-09-08 07:20:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29793 states to 29793 states and 47033 transitions. [2019-09-08 07:20:40,045 INFO L78 Accepts]: Start accepts. Automaton has 29793 states and 47033 transitions. Word has length 153 [2019-09-08 07:20:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:40,045 INFO L475 AbstractCegarLoop]: Abstraction has 29793 states and 47033 transitions. [2019-09-08 07:20:40,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:20:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29793 states and 47033 transitions. [2019-09-08 07:20:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:20:40,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:40,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:40,054 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash 385874921, now seen corresponding path program 1 times [2019-09-08 07:20:40,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:40,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:40,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:40,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 07:20:40,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 07:20:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 07:20:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:20:40,287 INFO L87 Difference]: Start difference. First operand 29793 states and 47033 transitions. Second operand 12 states. [2019-09-08 07:20:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:45,858 INFO L93 Difference]: Finished difference Result 43446 states and 68598 transitions. [2019-09-08 07:20:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 07:20:45,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2019-09-08 07:20:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:45,950 INFO L225 Difference]: With dead ends: 43446 [2019-09-08 07:20:45,950 INFO L226 Difference]: Without dead ends: 30797 [2019-09-08 07:20:45,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:20:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30797 states. [2019-09-08 07:20:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30797 to 30717. [2019-09-08 07:20:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30717 states. [2019-09-08 07:20:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30717 states to 30717 states and 48461 transitions. [2019-09-08 07:20:46,820 INFO L78 Accepts]: Start accepts. Automaton has 30717 states and 48461 transitions. Word has length 153 [2019-09-08 07:20:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:46,821 INFO L475 AbstractCegarLoop]: Abstraction has 30717 states and 48461 transitions. [2019-09-08 07:20:46,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 07:20:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30717 states and 48461 transitions. [2019-09-08 07:20:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:20:46,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:46,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:46,830 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1170588027, now seen corresponding path program 1 times [2019-09-08 07:20:46,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:46,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:47,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:20:47,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:20:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:20:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:47,007 INFO L87 Difference]: Start difference. First operand 30717 states and 48461 transitions. Second operand 6 states. [2019-09-08 07:20:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:49,033 INFO L93 Difference]: Finished difference Result 55881 states and 88199 transitions. [2019-09-08 07:20:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:20:49,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:20:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:49,174 INFO L225 Difference]: With dead ends: 55881 [2019-09-08 07:20:49,174 INFO L226 Difference]: Without dead ends: 32783 [2019-09-08 07:20:49,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32783 states. [2019-09-08 07:20:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32783 to 30784. [2019-09-08 07:20:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-09-08 07:20:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 48461 transitions. [2019-09-08 07:20:50,241 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 48461 transitions. Word has length 153 [2019-09-08 07:20:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:50,242 INFO L475 AbstractCegarLoop]: Abstraction has 30784 states and 48461 transitions. [2019-09-08 07:20:50,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:20:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 48461 transitions. [2019-09-08 07:20:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:20:50,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:50,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:50,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2027456679, now seen corresponding path program 1 times [2019-09-08 07:20:50,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:50,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:50,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:50,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:50,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:50,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:20:50,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:20:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:20:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:50,458 INFO L87 Difference]: Start difference. First operand 30784 states and 48461 transitions. Second operand 6 states. [2019-09-08 07:20:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:53,144 INFO L93 Difference]: Finished difference Result 55320 states and 88995 transitions. [2019-09-08 07:20:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:20:53,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:20:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:53,255 INFO L225 Difference]: With dead ends: 55320 [2019-09-08 07:20:53,256 INFO L226 Difference]: Without dead ends: 34584 [2019-09-08 07:20:53,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:20:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34584 states. [2019-09-08 07:20:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34584 to 31231. [2019-09-08 07:20:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31231 states. [2019-09-08 07:20:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31231 states to 31231 states and 49080 transitions. [2019-09-08 07:20:55,640 INFO L78 Accepts]: Start accepts. Automaton has 31231 states and 49080 transitions. Word has length 153 [2019-09-08 07:20:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:55,640 INFO L475 AbstractCegarLoop]: Abstraction has 31231 states and 49080 transitions. [2019-09-08 07:20:55,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:20:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31231 states and 49080 transitions. [2019-09-08 07:20:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:20:55,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:55,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:20:55,645 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1329850336, now seen corresponding path program 1 times [2019-09-08 07:20:55,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:20:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:55,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:20:55,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:20:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:20:55,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:55,806 INFO L87 Difference]: Start difference. First operand 31231 states and 49080 transitions. Second operand 6 states. [2019-09-08 07:20:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:59,078 INFO L93 Difference]: Finished difference Result 93857 states and 148079 transitions. [2019-09-08 07:20:59,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:20:59,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:20:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:59,221 INFO L225 Difference]: With dead ends: 93857 [2019-09-08 07:20:59,221 INFO L226 Difference]: Without dead ends: 62824 [2019-09-08 07:20:59,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62824 states. [2019-09-08 07:21:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62824 to 48824. [2019-09-08 07:21:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48824 states. [2019-09-08 07:21:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48824 states to 48824 states and 76796 transitions. [2019-09-08 07:21:00,683 INFO L78 Accepts]: Start accepts. Automaton has 48824 states and 76796 transitions. Word has length 153 [2019-09-08 07:21:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 48824 states and 76796 transitions. [2019-09-08 07:21:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 48824 states and 76796 transitions. [2019-09-08 07:21:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:00,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:00,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:00,690 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1012416599, now seen corresponding path program 1 times [2019-09-08 07:21:00,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:00,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:00,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:00,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:21:00,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:00,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:00,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:00,887 INFO L87 Difference]: Start difference. First operand 48824 states and 76796 transitions. Second operand 6 states. [2019-09-08 07:21:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:04,268 INFO L93 Difference]: Finished difference Result 85570 states and 137800 transitions. [2019-09-08 07:21:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:21:04,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:21:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:04,557 INFO L225 Difference]: With dead ends: 85570 [2019-09-08 07:21:04,557 INFO L226 Difference]: Without dead ends: 54496 [2019-09-08 07:21:04,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:21:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54496 states. [2019-09-08 07:21:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54496 to 49424. [2019-09-08 07:21:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49424 states. [2019-09-08 07:21:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49424 states to 49424 states and 77696 transitions. [2019-09-08 07:21:08,445 INFO L78 Accepts]: Start accepts. Automaton has 49424 states and 77696 transitions. Word has length 153 [2019-09-08 07:21:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:08,446 INFO L475 AbstractCegarLoop]: Abstraction has 49424 states and 77696 transitions. [2019-09-08 07:21:08,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 49424 states and 77696 transitions. [2019-09-08 07:21:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 07:21:08,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:08,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:08,450 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1308469339, now seen corresponding path program 1 times [2019-09-08 07:21:08,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:08,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:08,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:21:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:08,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:08,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:08,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:08,599 INFO L87 Difference]: Start difference. First operand 49424 states and 77696 transitions. Second operand 6 states. [2019-09-08 07:21:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:12,265 INFO L93 Difference]: Finished difference Result 114682 states and 179999 transitions. [2019-09-08 07:21:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:21:12,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-08 07:21:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:12,440 INFO L225 Difference]: With dead ends: 114682 [2019-09-08 07:21:12,440 INFO L226 Difference]: Without dead ends: 65456 [2019-09-08 07:21:12,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:21:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65456 states. [2019-09-08 07:21:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65456 to 64712. [2019-09-08 07:21:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64712 states. [2019-09-08 07:21:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64712 states to 64712 states and 101587 transitions. [2019-09-08 07:21:16,585 INFO L78 Accepts]: Start accepts. Automaton has 64712 states and 101587 transitions. Word has length 154 [2019-09-08 07:21:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:16,586 INFO L475 AbstractCegarLoop]: Abstraction has 64712 states and 101587 transitions. [2019-09-08 07:21:16,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 64712 states and 101587 transitions. [2019-09-08 07:21:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:21:16,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:16,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:16,591 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -697343369, now seen corresponding path program 1 times [2019-09-08 07:21:16,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:16,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:21:16,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:16,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:16,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:16,817 INFO L87 Difference]: Start difference. First operand 64712 states and 101587 transitions. Second operand 6 states. [2019-09-08 07:21:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:22,329 INFO L93 Difference]: Finished difference Result 194853 states and 307198 transitions. [2019-09-08 07:21:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:21:22,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 07:21:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:22,707 INFO L225 Difference]: With dead ends: 194853 [2019-09-08 07:21:22,707 INFO L226 Difference]: Without dead ends: 130339 [2019-09-08 07:21:22,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:21:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130339 states. [2019-09-08 07:21:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130339 to 97386. [2019-09-08 07:21:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97386 states. [2019-09-08 07:21:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97386 states to 97386 states and 153095 transitions. [2019-09-08 07:21:26,701 INFO L78 Accepts]: Start accepts. Automaton has 97386 states and 153095 transitions. Word has length 155 [2019-09-08 07:21:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:26,702 INFO L475 AbstractCegarLoop]: Abstraction has 97386 states and 153095 transitions. [2019-09-08 07:21:26,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 97386 states and 153095 transitions. [2019-09-08 07:21:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:21:26,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:26,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:26,705 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 950711842, now seen corresponding path program 1 times [2019-09-08 07:21:26,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:26,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:26,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:21:26,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:26,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 07:21:26,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 07:21:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 07:21:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:21:26,951 INFO L87 Difference]: Start difference. First operand 97386 states and 153095 transitions. Second operand 12 states. [2019-09-08 07:21:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:39,258 INFO L93 Difference]: Finished difference Result 169824 states and 270439 transitions. [2019-09-08 07:21:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 07:21:39,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-08 07:21:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:39,708 INFO L225 Difference]: With dead ends: 169824 [2019-09-08 07:21:39,708 INFO L226 Difference]: Without dead ends: 144161 [2019-09-08 07:21:39,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=598, Invalid=1952, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 07:21:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144161 states. [2019-09-08 07:21:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144161 to 130642. [2019-09-08 07:21:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130642 states. [2019-09-08 07:21:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130642 states to 130642 states and 206446 transitions. [2019-09-08 07:21:47,511 INFO L78 Accepts]: Start accepts. Automaton has 130642 states and 206446 transitions. Word has length 155 [2019-09-08 07:21:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:47,511 INFO L475 AbstractCegarLoop]: Abstraction has 130642 states and 206446 transitions. [2019-09-08 07:21:47,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 07:21:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 130642 states and 206446 transitions. [2019-09-08 07:21:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:21:47,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:47,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:21:47,516 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 441238752, now seen corresponding path program 1 times [2019-09-08 07:21:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:47,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:21:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:21:47,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:21:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:21:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:21:47,699 INFO L87 Difference]: Start difference. First operand 130642 states and 206446 transitions. Second operand 7 states. [2019-09-08 07:21:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:55,062 INFO L93 Difference]: Finished difference Result 237246 states and 375815 transitions. [2019-09-08 07:21:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:21:55,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-08 07:21:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:55,524 INFO L225 Difference]: With dead ends: 237246 [2019-09-08 07:21:55,524 INFO L226 Difference]: Without dead ends: 170748 [2019-09-08 07:21:55,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:21:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170748 states. [2019-09-08 07:22:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170748 to 170413. [2019-09-08 07:22:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170413 states. [2019-09-08 07:22:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170413 states to 170413 states and 269870 transitions. [2019-09-08 07:22:05,200 INFO L78 Accepts]: Start accepts. Automaton has 170413 states and 269870 transitions. Word has length 155 [2019-09-08 07:22:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:05,200 INFO L475 AbstractCegarLoop]: Abstraction has 170413 states and 269870 transitions. [2019-09-08 07:22:05,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:22:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 170413 states and 269870 transitions. [2019-09-08 07:22:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 07:22:05,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:05,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:22:05,205 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1018171407, now seen corresponding path program 1 times [2019-09-08 07:22:05,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:05,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:22:05,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:05,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:22:05,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:22:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:22:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:22:05,483 INFO L87 Difference]: Start difference. First operand 170413 states and 269870 transitions. Second operand 5 states. [2019-09-08 07:22:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:22:19,912 INFO L93 Difference]: Finished difference Result 507009 states and 812705 transitions. [2019-09-08 07:22:19,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:22:19,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 07:22:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:22:20,958 INFO L225 Difference]: With dead ends: 507009 [2019-09-08 07:22:20,958 INFO L226 Difference]: Without dead ends: 336630 [2019-09-08 07:22:21,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:22:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336630 states. [2019-09-08 07:22:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336630 to 336628. [2019-09-08 07:22:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336628 states. [2019-09-08 07:22:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336628 states to 336628 states and 527196 transitions. [2019-09-08 07:22:45,385 INFO L78 Accepts]: Start accepts. Automaton has 336628 states and 527196 transitions. Word has length 157 [2019-09-08 07:22:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:45,385 INFO L475 AbstractCegarLoop]: Abstraction has 336628 states and 527196 transitions. [2019-09-08 07:22:45,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:22:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 336628 states and 527196 transitions. [2019-09-08 07:22:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 07:22:45,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:45,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:22:45,391 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1250405517, now seen corresponding path program 1 times [2019-09-08 07:22:45,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:45,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:45,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:22:45,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:45,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:22:45,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:22:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:22:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:22:45,643 INFO L87 Difference]: Start difference. First operand 336628 states and 527196 transitions. Second operand 5 states. [2019-09-08 07:23:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:23:16,561 INFO L93 Difference]: Finished difference Result 1001553 states and 1586369 transitions. [2019-09-08 07:23:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:23:16,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 07:23:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:23:18,546 INFO L225 Difference]: With dead ends: 1001553 [2019-09-08 07:23:18,546 INFO L226 Difference]: Without dead ends: 664941 [2019-09-08 07:23:19,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:23:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664941 states. [2019-09-08 07:24:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664941 to 664939. [2019-09-08 07:24:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664939 states. [2019-09-08 07:24:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664939 states to 664939 states and 1029423 transitions. [2019-09-08 07:24:07,241 INFO L78 Accepts]: Start accepts. Automaton has 664939 states and 1029423 transitions. Word has length 157 [2019-09-08 07:24:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:24:07,242 INFO L475 AbstractCegarLoop]: Abstraction has 664939 states and 1029423 transitions. [2019-09-08 07:24:07,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:24:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 664939 states and 1029423 transitions. [2019-09-08 07:24:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:24:07,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:24:07,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:24:07,256 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:24:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:24:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 388898933, now seen corresponding path program 1 times [2019-09-08 07:24:07,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:24:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:24:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:24:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:24:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:24:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:24:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:24:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:24:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 07:24:07,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 07:24:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 07:24:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:24:07,529 INFO L87 Difference]: Start difference. First operand 664939 states and 1029423 transitions. Second operand 16 states. [2019-09-08 07:24:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:24:51,952 INFO L93 Difference]: Finished difference Result 928990 states and 1440362 transitions. [2019-09-08 07:24:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 07:24:51,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-09-08 07:24:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:24:54,462 INFO L225 Difference]: With dead ends: 928990 [2019-09-08 07:24:54,462 INFO L226 Difference]: Without dead ends: 811457 [2019-09-08 07:24:55,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:24:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811457 states. [2019-09-08 07:25:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811457 to 665425. [2019-09-08 07:25:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665425 states. [2019-09-08 07:25:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665425 states to 665425 states and 1030130 transitions. [2019-09-08 07:25:52,611 INFO L78 Accepts]: Start accepts. Automaton has 665425 states and 1030130 transitions. Word has length 159 [2019-09-08 07:25:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:25:52,612 INFO L475 AbstractCegarLoop]: Abstraction has 665425 states and 1030130 transitions. [2019-09-08 07:25:52,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 07:25:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 665425 states and 1030130 transitions. [2019-09-08 07:25:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:25:52,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:25:52,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:25:52,627 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:25:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:25:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash -508494345, now seen corresponding path program 1 times [2019-09-08 07:25:52,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:25:52,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:25:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:25:52,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:25:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:25:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:25:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:25:52,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:25:52,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:25:52,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:25:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:25:52,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:25:52,769 INFO L87 Difference]: Start difference. First operand 665425 states and 1030130 transitions. Second operand 10 states. [2019-09-08 07:26:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:26:40,685 INFO L93 Difference]: Finished difference Result 1206281 states and 1879475 transitions. [2019-09-08 07:26:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:26:40,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-09-08 07:26:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:26:53,370 INFO L225 Difference]: With dead ends: 1206281 [2019-09-08 07:26:53,370 INFO L226 Difference]: Without dead ends: 919214 [2019-09-08 07:26:53,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:26:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919214 states. [2019-09-08 07:27:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919214 to 678025. [2019-09-08 07:27:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678025 states. [2019-09-08 07:27:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678025 states to 678025 states and 1050151 transitions. [2019-09-08 07:27:45,609 INFO L78 Accepts]: Start accepts. Automaton has 678025 states and 1050151 transitions. Word has length 159 [2019-09-08 07:27:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:27:45,610 INFO L475 AbstractCegarLoop]: Abstraction has 678025 states and 1050151 transitions. [2019-09-08 07:27:45,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:27:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 678025 states and 1050151 transitions. [2019-09-08 07:27:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:27:45,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:27:45,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:27:45,620 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:27:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:27:45,620 INFO L82 PathProgramCache]: Analyzing trace with hash 832799607, now seen corresponding path program 1 times [2019-09-08 07:27:45,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:27:45,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:27:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:45,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:27:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:27:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:27:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:27:45,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:27:45,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:27:45,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:27:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:27:45,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:27:45,781 INFO L87 Difference]: Start difference. First operand 678025 states and 1050151 transitions. Second operand 10 states. [2019-09-08 07:28:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:28:31,639 INFO L93 Difference]: Finished difference Result 1145943 states and 1789152 transitions. [2019-09-08 07:28:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:28:31,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-09-08 07:28:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:28:34,106 INFO L225 Difference]: With dead ends: 1145943 [2019-09-08 07:28:34,107 INFO L226 Difference]: Without dead ends: 868447 [2019-09-08 07:28:34,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:28:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868447 states. [2019-09-08 07:29:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868447 to 676916. [2019-09-08 07:29:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676916 states. [2019-09-08 07:29:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676916 states to 676916 states and 1048409 transitions. [2019-09-08 07:29:34,486 INFO L78 Accepts]: Start accepts. Automaton has 676916 states and 1048409 transitions. Word has length 159 [2019-09-08 07:29:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:29:34,487 INFO L475 AbstractCegarLoop]: Abstraction has 676916 states and 1048409 transitions. [2019-09-08 07:29:34,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:29:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 676916 states and 1048409 transitions. [2019-09-08 07:29:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:29:34,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:29:34,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:29:34,494 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:29:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:29:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash -64593671, now seen corresponding path program 1 times [2019-09-08 07:29:34,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:29:34,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:29:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:34,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:29:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:29:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:29:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:29:34,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:29:34,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:29:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:29:34,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:29:34,679 INFO L87 Difference]: Start difference. First operand 676916 states and 1048409 transitions. Second operand 5 states.