java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:32:12,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:32:12,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:32:12,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:32:12,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:32:12,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:32:12,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:32:12,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:32:12,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:32:12,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:32:12,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:32:12,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:32:12,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:32:12,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:32:12,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:32:12,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:32:12,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:32:12,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:32:12,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:32:12,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:32:12,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:32:12,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:32:12,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:32:12,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:32:12,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:32:12,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:32:12,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:32:12,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:32:12,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:32:12,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:32:12,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:32:12,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:32:12,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:32:12,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:32:12,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:32:12,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:32:12,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:32:12,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:32:12,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:32:12,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:32:12,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:32:12,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:32:12,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:32:12,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:32:12,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:32:12,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:32:12,951 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:32:12,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:32:12,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:32:12,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:32:12,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:32:12,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:32:12,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:32:12,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:32:12,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:32:12,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:32:12,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:32:12,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:32:12,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:32:12,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:32:12,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:32:12,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:32:12,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:32:12,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:32:12,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:32:12,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:32:12,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:32:12,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:32:12,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:32:12,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:32:12,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:32:12,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:32:13,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:32:13,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:32:13,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:32:13,011 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:32:13,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:32:13,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95168bdb1/d9e408ba9d3841719ce22bf379b9152f/FLAG4a789ac72 [2019-09-08 13:32:13,840 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:32:13,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:32:13,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95168bdb1/d9e408ba9d3841719ce22bf379b9152f/FLAG4a789ac72 [2019-09-08 13:32:13,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95168bdb1/d9e408ba9d3841719ce22bf379b9152f [2019-09-08 13:32:13,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:32:13,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:32:13,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:32:13,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:32:13,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:32:13,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:32:13" (1/1) ... [2019-09-08 13:32:13,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ababd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:13, skipping insertion in model container [2019-09-08 13:32:13,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:32:13" (1/1) ... [2019-09-08 13:32:13,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:32:14,199 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:32:15,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:32:15,830 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:32:17,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:32:17,313 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:32:17,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17 WrapperNode [2019-09-08 13:32:17,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:32:17,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:32:17,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:32:17,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:32:17,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (1/1) ... [2019-09-08 13:32:17,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:32:17,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:32:17,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:32:17,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:32:17,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (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 13:32:17,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:32:17,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:32:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:32:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:32:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:32:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:32:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:32:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:32:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:32:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:32:17,612 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:32:17,612 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:32:17,612 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:32:17,612 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:32:17,612 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:32:17,613 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:32:17,614 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:32:17,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:32:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:32:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:32:22,174 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:32:22,176 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:32:22,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:32:22 BoogieIcfgContainer [2019-09-08 13:32:22,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:32:22,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:32:22,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:32:22,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:32:22,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:32:13" (1/3) ... [2019-09-08 13:32:22,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56800321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:32:22, skipping insertion in model container [2019-09-08 13:32:22,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:32:17" (2/3) ... [2019-09-08 13:32:22,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56800321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:32:22, skipping insertion in model container [2019-09-08 13:32:22,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:32:22" (3/3) ... [2019-09-08 13:32:22,192 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:32:22,203 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:32:22,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 13:32:22,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 13:32:22,309 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:32:22,310 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:32:22,310 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:32:22,310 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:32:22,311 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:32:22,311 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:32:22,311 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:32:22,311 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:32:22,311 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:32:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states. [2019-09-08 13:32:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-08 13:32:22,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:22,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:22,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1482850524, now seen corresponding path program 1 times [2019-09-08 13:32:22,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:22,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:25,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:25,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:25,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:25,429 INFO L87 Difference]: Start difference. First operand 1484 states. Second operand 4 states. [2019-09-08 13:32:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:26,048 INFO L93 Difference]: Finished difference Result 4394 states and 7936 transitions. [2019-09-08 13:32:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:32:26,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 484 [2019-09-08 13:32:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:26,101 INFO L225 Difference]: With dead ends: 4394 [2019-09-08 13:32:26,101 INFO L226 Difference]: Without dead ends: 2919 [2019-09-08 13:32:26,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:32:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-09-08 13:32:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2865. [2019-09-08 13:32:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-08 13:32:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4721 transitions. [2019-09-08 13:32:26,413 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4721 transitions. Word has length 484 [2019-09-08 13:32:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:26,418 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4721 transitions. [2019-09-08 13:32:26,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:32:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4721 transitions. [2019-09-08 13:32:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2019-09-08 13:32:26,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:26,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:26,439 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1582947656, now seen corresponding path program 1 times [2019-09-08 13:32:26,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:27,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:27,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:27,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:27,333 INFO L87 Difference]: Start difference. First operand 2865 states and 4721 transitions. Second operand 3 states. [2019-09-08 13:32:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:27,715 INFO L93 Difference]: Finished difference Result 8316 states and 13666 transitions. [2019-09-08 13:32:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:27,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2019-09-08 13:32:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:27,748 INFO L225 Difference]: With dead ends: 8316 [2019-09-08 13:32:27,748 INFO L226 Difference]: Without dead ends: 5665 [2019-09-08 13:32:27,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2019-09-08 13:32:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5613. [2019-09-08 13:32:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-09-08 13:32:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 9225 transitions. [2019-09-08 13:32:28,038 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 9225 transitions. Word has length 486 [2019-09-08 13:32:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:28,039 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 9225 transitions. [2019-09-08 13:32:28,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 9225 transitions. [2019-09-08 13:32:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-08 13:32:28,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:28,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:28,063 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash 318518103, now seen corresponding path program 1 times [2019-09-08 13:32:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:28,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:28,463 INFO L87 Difference]: Start difference. First operand 5613 states and 9225 transitions. Second operand 3 states. [2019-09-08 13:32:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:28,889 INFO L93 Difference]: Finished difference Result 16742 states and 27507 transitions. [2019-09-08 13:32:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:28,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-08 13:32:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:28,945 INFO L225 Difference]: With dead ends: 16742 [2019-09-08 13:32:28,946 INFO L226 Difference]: Without dead ends: 11181 [2019-09-08 13:32:28,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2019-09-08 13:32:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 5660. [2019-09-08 13:32:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5660 states. [2019-09-08 13:32:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5660 states to 5660 states and 9299 transitions. [2019-09-08 13:32:29,290 INFO L78 Accepts]: Start accepts. Automaton has 5660 states and 9299 transitions. Word has length 487 [2019-09-08 13:32:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:29,291 INFO L475 AbstractCegarLoop]: Abstraction has 5660 states and 9299 transitions. [2019-09-08 13:32:29,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5660 states and 9299 transitions. [2019-09-08 13:32:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 13:32:29,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:29,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:29,306 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1969727779, now seen corresponding path program 1 times [2019-09-08 13:32:29,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:29,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:29,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:30,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:30,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:30,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:30,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:30,126 INFO L87 Difference]: Start difference. First operand 5660 states and 9299 transitions. Second operand 3 states. [2019-09-08 13:32:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:30,668 INFO L93 Difference]: Finished difference Result 16304 states and 26694 transitions. [2019-09-08 13:32:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:30,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-08 13:32:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:30,731 INFO L225 Difference]: With dead ends: 16304 [2019-09-08 13:32:30,731 INFO L226 Difference]: Without dead ends: 11043 [2019-09-08 13:32:30,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2019-09-08 13:32:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 10993. [2019-09-08 13:32:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10993 states. [2019-09-08 13:32:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10993 states to 10993 states and 17977 transitions. [2019-09-08 13:32:31,888 INFO L78 Accepts]: Start accepts. Automaton has 10993 states and 17977 transitions. Word has length 488 [2019-09-08 13:32:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:31,889 INFO L475 AbstractCegarLoop]: Abstraction has 10993 states and 17977 transitions. [2019-09-08 13:32:31,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10993 states and 17977 transitions. [2019-09-08 13:32:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 13:32:31,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:31,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:31,917 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1667846312, now seen corresponding path program 1 times [2019-09-08 13:32:31,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:31,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:32,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:32,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:32,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:32,188 INFO L87 Difference]: Start difference. First operand 10993 states and 17977 transitions. Second operand 3 states. [2019-09-08 13:32:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:32,981 INFO L93 Difference]: Finished difference Result 32723 states and 53486 transitions. [2019-09-08 13:32:32,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:32,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 488 [2019-09-08 13:32:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:33,040 INFO L225 Difference]: With dead ends: 32723 [2019-09-08 13:32:33,041 INFO L226 Difference]: Without dead ends: 21874 [2019-09-08 13:32:33,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21874 states. [2019-09-08 13:32:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21874 to 11091. [2019-09-08 13:32:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11091 states. [2019-09-08 13:32:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11091 states to 11091 states and 18128 transitions. [2019-09-08 13:32:33,844 INFO L78 Accepts]: Start accepts. Automaton has 11091 states and 18128 transitions. Word has length 488 [2019-09-08 13:32:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:33,845 INFO L475 AbstractCegarLoop]: Abstraction has 11091 states and 18128 transitions. [2019-09-08 13:32:33,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11091 states and 18128 transitions. [2019-09-08 13:32:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-08 13:32:33,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:33,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:33,874 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1361971304, now seen corresponding path program 1 times [2019-09-08 13:32:33,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:33,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:34,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:34,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:34,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:34,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:34,141 INFO L87 Difference]: Start difference. First operand 11091 states and 18128 transitions. Second operand 3 states. [2019-09-08 13:32:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:34,964 INFO L93 Difference]: Finished difference Result 32858 states and 53667 transitions. [2019-09-08 13:32:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:34,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 489 [2019-09-08 13:32:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:35,019 INFO L225 Difference]: With dead ends: 32858 [2019-09-08 13:32:35,020 INFO L226 Difference]: Without dead ends: 21991 [2019-09-08 13:32:35,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21991 states. [2019-09-08 13:32:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21991 to 11208. [2019-09-08 13:32:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11208 states. [2019-09-08 13:32:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11208 states to 11208 states and 18274 transitions. [2019-09-08 13:32:35,643 INFO L78 Accepts]: Start accepts. Automaton has 11208 states and 18274 transitions. Word has length 489 [2019-09-08 13:32:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:35,644 INFO L475 AbstractCegarLoop]: Abstraction has 11208 states and 18274 transitions. [2019-09-08 13:32:35,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11208 states and 18274 transitions. [2019-09-08 13:32:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 13:32:35,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:35,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:35,674 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:35,679 INFO L82 PathProgramCache]: Analyzing trace with hash -27739360, now seen corresponding path program 1 times [2019-09-08 13:32:35,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:35,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:35,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:36,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:36,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:36,007 INFO L87 Difference]: Start difference. First operand 11208 states and 18274 transitions. Second operand 3 states. [2019-09-08 13:32:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:36,929 INFO L93 Difference]: Finished difference Result 21557 states and 34732 transitions. [2019-09-08 13:32:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:36,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-08 13:32:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:36,973 INFO L225 Difference]: With dead ends: 21557 [2019-09-08 13:32:36,973 INFO L226 Difference]: Without dead ends: 14874 [2019-09-08 13:32:36,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14874 states. [2019-09-08 13:32:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14874 to 12752. [2019-09-08 13:32:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12752 states. [2019-09-08 13:32:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12752 states to 12752 states and 20834 transitions. [2019-09-08 13:32:37,662 INFO L78 Accepts]: Start accepts. Automaton has 12752 states and 20834 transitions. Word has length 490 [2019-09-08 13:32:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:37,663 INFO L475 AbstractCegarLoop]: Abstraction has 12752 states and 20834 transitions. [2019-09-08 13:32:37,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 12752 states and 20834 transitions. [2019-09-08 13:32:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 13:32:37,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:37,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:37,686 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1807614690, now seen corresponding path program 1 times [2019-09-08 13:32:37,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:38,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:38,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:38,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:38,257 INFO L87 Difference]: Start difference. First operand 12752 states and 20834 transitions. Second operand 3 states. [2019-09-08 13:32:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:39,269 INFO L93 Difference]: Finished difference Result 36492 states and 59503 transitions. [2019-09-08 13:32:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:39,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-08 13:32:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:39,326 INFO L225 Difference]: With dead ends: 36492 [2019-09-08 13:32:39,326 INFO L226 Difference]: Without dead ends: 24709 [2019-09-08 13:32:39,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24709 states. [2019-09-08 13:32:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24709 to 24661. [2019-09-08 13:32:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24661 states. [2019-09-08 13:32:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24661 states to 24661 states and 40123 transitions. [2019-09-08 13:32:41,167 INFO L78 Accepts]: Start accepts. Automaton has 24661 states and 40123 transitions. Word has length 490 [2019-09-08 13:32:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:41,167 INFO L475 AbstractCegarLoop]: Abstraction has 24661 states and 40123 transitions. [2019-09-08 13:32:41,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24661 states and 40123 transitions. [2019-09-08 13:32:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 13:32:41,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:41,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:41,190 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -484300805, now seen corresponding path program 1 times [2019-09-08 13:32:41,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:41,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:41,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:41,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:41,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:41,912 INFO L87 Difference]: Start difference. First operand 24661 states and 40123 transitions. Second operand 4 states. [2019-09-08 13:32:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:43,346 INFO L93 Difference]: Finished difference Result 69082 states and 111940 transitions. [2019-09-08 13:32:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:32:43,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 490 [2019-09-08 13:32:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:43,407 INFO L225 Difference]: With dead ends: 69082 [2019-09-08 13:32:43,407 INFO L226 Difference]: Without dead ends: 46701 [2019-09-08 13:32:43,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:32:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46701 states. [2019-09-08 13:32:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46701 to 25954. [2019-09-08 13:32:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25954 states. [2019-09-08 13:32:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25954 states to 25954 states and 42402 transitions. [2019-09-08 13:32:44,604 INFO L78 Accepts]: Start accepts. Automaton has 25954 states and 42402 transitions. Word has length 490 [2019-09-08 13:32:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 25954 states and 42402 transitions. [2019-09-08 13:32:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:32:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 25954 states and 42402 transitions. [2019-09-08 13:32:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-08 13:32:44,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:44,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:44,630 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:44,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash -560777755, now seen corresponding path program 1 times [2019-09-08 13:32:44,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:44,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:44,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:44,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:45,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:45,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:32:45,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:32:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:32:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:45,125 INFO L87 Difference]: Start difference. First operand 25954 states and 42402 transitions. Second operand 3 states. [2019-09-08 13:32:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:46,236 INFO L93 Difference]: Finished difference Result 50210 states and 81403 transitions. [2019-09-08 13:32:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:46,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-09-08 13:32:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:46,306 INFO L225 Difference]: With dead ends: 50210 [2019-09-08 13:32:46,306 INFO L226 Difference]: Without dead ends: 34861 [2019-09-08 13:32:46,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-09-08 13:32:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 31474. [2019-09-08 13:32:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31474 states. [2019-09-08 13:32:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31474 states to 31474 states and 51538 transitions. [2019-09-08 13:32:47,742 INFO L78 Accepts]: Start accepts. Automaton has 31474 states and 51538 transitions. Word has length 492 [2019-09-08 13:32:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:47,743 INFO L475 AbstractCegarLoop]: Abstraction has 31474 states and 51538 transitions. [2019-09-08 13:32:47,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31474 states and 51538 transitions. [2019-09-08 13:32:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 13:32:47,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:47,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:47,766 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1153218066, now seen corresponding path program 1 times [2019-09-08 13:32:47,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:47,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:47,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:48,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:48,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:32:48,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:32:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:32:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:32:48,666 INFO L87 Difference]: Start difference. First operand 31474 states and 51538 transitions. Second operand 9 states. [2019-09-08 13:32:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:54,681 INFO L93 Difference]: Finished difference Result 82599 states and 134417 transitions. [2019-09-08 13:32:54,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:32:54,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 493 [2019-09-08 13:32:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:54,772 INFO L225 Difference]: With dead ends: 82599 [2019-09-08 13:32:54,773 INFO L226 Difference]: Without dead ends: 61266 [2019-09-08 13:32:54,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:32:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61266 states. [2019-09-08 13:32:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61266 to 37546. [2019-09-08 13:32:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37546 states. [2019-09-08 13:32:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37546 states to 37546 states and 60518 transitions. [2019-09-08 13:32:56,821 INFO L78 Accepts]: Start accepts. Automaton has 37546 states and 60518 transitions. Word has length 493 [2019-09-08 13:32:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:56,822 INFO L475 AbstractCegarLoop]: Abstraction has 37546 states and 60518 transitions. [2019-09-08 13:32:56,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:32:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37546 states and 60518 transitions. [2019-09-08 13:32:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 13:32:56,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:56,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:56,853 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 706747481, now seen corresponding path program 1 times [2019-09-08 13:32:56,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:56,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:58,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:58,005 INFO L87 Difference]: Start difference. First operand 37546 states and 60518 transitions. Second operand 4 states. [2019-09-08 13:33:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:01,555 INFO L93 Difference]: Finished difference Result 110510 states and 178151 transitions. [2019-09-08 13:33:01,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:33:01,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-08 13:33:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:01,639 INFO L225 Difference]: With dead ends: 110510 [2019-09-08 13:33:01,640 INFO L226 Difference]: Without dead ends: 73227 [2019-09-08 13:33:01,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:33:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73227 states. [2019-09-08 13:33:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73227 to 73184. [2019-09-08 13:33:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73184 states. [2019-09-08 13:33:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73184 states to 73184 states and 117560 transitions. [2019-09-08 13:33:06,781 INFO L78 Accepts]: Start accepts. Automaton has 73184 states and 117560 transitions. Word has length 493 [2019-09-08 13:33:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:06,781 INFO L475 AbstractCegarLoop]: Abstraction has 73184 states and 117560 transitions. [2019-09-08 13:33:06,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:33:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 73184 states and 117560 transitions. [2019-09-08 13:33:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-08 13:33:06,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:06,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:33:06,822 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -852505819, now seen corresponding path program 1 times [2019-09-08 13:33:06,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:33:07,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:07,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:33:07,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:33:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:33:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:07,325 INFO L87 Difference]: Start difference. First operand 73184 states and 117560 transitions. Second operand 3 states. [2019-09-08 13:33:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:15,706 INFO L93 Difference]: Finished difference Result 212671 states and 341013 transitions. [2019-09-08 13:33:15,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:33:15,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-08 13:33:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:15,842 INFO L225 Difference]: With dead ends: 212671 [2019-09-08 13:33:15,843 INFO L226 Difference]: Without dead ends: 143055 [2019-09-08 13:33:15,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143055 states. [2019-09-08 13:33:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143055 to 143014. [2019-09-08 13:33:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143014 states. [2019-09-08 13:33:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143014 states to 143014 states and 228977 transitions. [2019-09-08 13:33:25,494 INFO L78 Accepts]: Start accepts. Automaton has 143014 states and 228977 transitions. Word has length 495 [2019-09-08 13:33:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:25,494 INFO L475 AbstractCegarLoop]: Abstraction has 143014 states and 228977 transitions. [2019-09-08 13:33:25,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:33:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 143014 states and 228977 transitions. [2019-09-08 13:33:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-08 13:33:25,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:25,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:33:25,568 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash -661080985, now seen corresponding path program 1 times [2019-09-08 13:33:25,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:25,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:25,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:33:25,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:25,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:33:25,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:33:25,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:33:25,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:25,824 INFO L87 Difference]: Start difference. First operand 143014 states and 228977 transitions. Second operand 3 states. [2019-09-08 13:33:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:42,109 INFO L93 Difference]: Finished difference Result 408356 states and 650151 transitions. [2019-09-08 13:33:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:33:42,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-08 13:33:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:42,430 INFO L225 Difference]: With dead ends: 408356 [2019-09-08 13:33:42,430 INFO L226 Difference]: Without dead ends: 275834 [2019-09-08 13:33:42,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275834 states. [2019-09-08 13:33:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275834 to 144776. [2019-09-08 13:33:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144776 states. [2019-09-08 13:33:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144776 states to 144776 states and 231635 transitions. [2019-09-08 13:33:51,609 INFO L78 Accepts]: Start accepts. Automaton has 144776 states and 231635 transitions. Word has length 495 [2019-09-08 13:33:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:51,609 INFO L475 AbstractCegarLoop]: Abstraction has 144776 states and 231635 transitions. [2019-09-08 13:33:51,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:33:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 144776 states and 231635 transitions. [2019-09-08 13:33:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 13:33:51,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:51,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:33:51,685 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:51,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1789173245, now seen corresponding path program 1 times [2019-09-08 13:33:51,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:33:52,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:52,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:33:52,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:33:52,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:33:52,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:52,129 INFO L87 Difference]: Start difference. First operand 144776 states and 231635 transitions. Second operand 3 states. [2019-09-08 13:34:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:06,440 INFO L93 Difference]: Finished difference Result 316405 states and 505241 transitions. [2019-09-08 13:34:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:34:06,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-08 13:34:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:06,716 INFO L225 Difference]: With dead ends: 316405 [2019-09-08 13:34:06,716 INFO L226 Difference]: Without dead ends: 213315 [2019-09-08 13:34:06,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213315 states. [2019-09-08 13:34:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213315 to 196360. [2019-09-08 13:34:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196360 states. [2019-09-08 13:34:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196360 states to 196360 states and 314691 transitions. [2019-09-08 13:34:23,421 INFO L78 Accepts]: Start accepts. Automaton has 196360 states and 314691 transitions. Word has length 496 [2019-09-08 13:34:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:23,422 INFO L475 AbstractCegarLoop]: Abstraction has 196360 states and 314691 transitions. [2019-09-08 13:34:23,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:34:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 196360 states and 314691 transitions. [2019-09-08 13:34:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 13:34:23,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:23,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:34:23,499 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1067056945, now seen corresponding path program 1 times [2019-09-08 13:34:23,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:34:23,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:23,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:34:23,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:34:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:34:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:23,750 INFO L87 Difference]: Start difference. First operand 196360 states and 314691 transitions. Second operand 3 states. [2019-09-08 13:34:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:49,262 INFO L93 Difference]: Finished difference Result 565982 states and 903418 transitions. [2019-09-08 13:34:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:34:49,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-08 13:34:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:49,741 INFO L225 Difference]: With dead ends: 565982 [2019-09-08 13:34:49,741 INFO L226 Difference]: Without dead ends: 381424 [2019-09-08 13:34:49,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381424 states. [2019-09-08 13:35:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381424 to 198910. [2019-09-08 13:35:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198910 states. [2019-09-08 13:35:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198910 states to 198910 states and 318360 transitions. [2019-09-08 13:35:10,325 INFO L78 Accepts]: Start accepts. Automaton has 198910 states and 318360 transitions. Word has length 496 [2019-09-08 13:35:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:35:10,326 INFO L475 AbstractCegarLoop]: Abstraction has 198910 states and 318360 transitions. [2019-09-08 13:35:10,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:35:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 198910 states and 318360 transitions. [2019-09-08 13:35:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-08 13:35:10,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:35:10,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:35:10,405 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:35:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:35:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1294873546, now seen corresponding path program 1 times [2019-09-08 13:35:10,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:35:10,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:35:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:10,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:35:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:35:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:35:11,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:35:11,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:35:11,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:35:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:35:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:35:11,290 INFO L87 Difference]: Start difference. First operand 198910 states and 318360 transitions. Second operand 3 states. [2019-09-08 13:35:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:35:39,193 INFO L93 Difference]: Finished difference Result 587387 states and 939538 transitions. [2019-09-08 13:35:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:35:39,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-08 13:35:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:35:40,311 INFO L225 Difference]: With dead ends: 587387 [2019-09-08 13:35:40,312 INFO L226 Difference]: Without dead ends: 392491 [2019-09-08 13:35:40,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:35:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392491 states. [2019-09-08 13:36:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392491 to 392452. [2019-09-08 13:36:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392452 states. [2019-09-08 13:36:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392452 states to 392452 states and 625960 transitions. [2019-09-08 13:36:18,163 INFO L78 Accepts]: Start accepts. Automaton has 392452 states and 625960 transitions. Word has length 497 [2019-09-08 13:36:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:36:18,164 INFO L475 AbstractCegarLoop]: Abstraction has 392452 states and 625960 transitions. [2019-09-08 13:36:18,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:36:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 392452 states and 625960 transitions. [2019-09-08 13:36:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:36:18,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:18,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:36:18,959 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 995358799, now seen corresponding path program 1 times [2019-09-08 13:36:18,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:18,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:18,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:18,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:18,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:36:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:36:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:36:19,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:36:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:36:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:36:19,401 INFO L87 Difference]: Start difference. First operand 392452 states and 625960 transitions. Second operand 3 states. [2019-09-08 13:37:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:27,049 INFO L93 Difference]: Finished difference Result 1152237 states and 1835128 transitions. [2019-09-08 13:37:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:27,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-08 13:37:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:28,204 INFO L225 Difference]: With dead ends: 1152237 [2019-09-08 13:37:28,205 INFO L226 Difference]: Without dead ends: 770922 [2019-09-08 13:37:28,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770922 states. [2019-09-08 13:38:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770922 to 770885. [2019-09-08 13:38:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770885 states. [2019-09-08 13:38:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770885 states to 770885 states and 1224607 transitions. [2019-09-08 13:38:41,356 INFO L78 Accepts]: Start accepts. Automaton has 770885 states and 1224607 transitions. Word has length 499 [2019-09-08 13:38:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:41,357 INFO L475 AbstractCegarLoop]: Abstraction has 770885 states and 1224607 transitions. [2019-09-08 13:38:41,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 770885 states and 1224607 transitions. [2019-09-08 13:38:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:38:42,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:42,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:38:42,843 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 255085266, now seen corresponding path program 1 times [2019-09-08 13:38:42,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:42,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:42,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:42,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:38:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:38:43,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:38:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:38:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:38:43,571 INFO L87 Difference]: Start difference. First operand 770885 states and 1224607 transitions. Second operand 4 states. [2019-09-08 13:40:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:55,339 INFO L93 Difference]: Finished difference Result 2188987 states and 3468380 transitions. [2019-09-08 13:40:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:40:55,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-08 13:40:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:57,297 INFO L225 Difference]: With dead ends: 2188987 [2019-09-08 13:40:57,297 INFO L226 Difference]: Without dead ends: 1453874 [2019-09-08 13:40:57,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:40:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453874 states. [2019-09-08 13:42:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453874 to 785583. [2019-09-08 13:42:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785583 states. [2019-09-08 13:42:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785583 states to 785583 states and 1250608 transitions. [2019-09-08 13:42:37,004 INFO L78 Accepts]: Start accepts. Automaton has 785583 states and 1250608 transitions. Word has length 499 [2019-09-08 13:42:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:37,004 INFO L475 AbstractCegarLoop]: Abstraction has 785583 states and 1250608 transitions. [2019-09-08 13:42:37,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:42:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 785583 states and 1250608 transitions. [2019-09-08 13:42:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-08 13:42:37,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:37,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:37,400 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1053902861, now seen corresponding path program 1 times [2019-09-08 13:42:37,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:37,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 13:42:37,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:42:37,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:42:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:42:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:42:37,700 INFO L87 Difference]: Start difference. First operand 785583 states and 1250608 transitions. Second operand 3 states.