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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:28:29,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:28:29,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:28:29,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:28:29,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:28:29,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:28:29,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:28:29,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:28:29,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:28:29,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:28:29,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:28:29,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:28:29,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:28:29,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:28:29,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:28:29,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:28:29,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:28:29,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:28:29,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:28:29,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:28:29,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:28:29,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:28:29,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:28:29,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:28:29,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:28:29,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:28:29,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:28:29,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:28:29,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:28:29,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:28:29,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:28:29,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:28:29,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:28:29,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:28:29,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:28:29,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:28:29,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:28:29,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:28:29,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:28:29,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:28:29,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:28:29,160 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:28:29,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:28:29,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:28:29,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:28:29,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:28:29,180 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:28:29,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:28:29,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:28:29,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:28:29,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:28:29,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:28:29,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:28:29,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:28:29,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:28:29,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:28:29,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:28:29,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:28:29,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:28:29,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:28:29,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:28:29,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:28:29,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:28:29,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:28:29,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:28:29,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:28:29,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:28:29,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:28:29,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:28:29,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:28:29,239 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:28:29,240 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:28:29,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cf66255/32e810137dea4e40964499cd1bfc0c7d/FLAG7be53f42d [2019-09-08 13:28:30,015 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:28:30,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:28:30,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cf66255/32e810137dea4e40964499cd1bfc0c7d/FLAG7be53f42d [2019-09-08 13:28:30,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cf66255/32e810137dea4e40964499cd1bfc0c7d [2019-09-08 13:28:30,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:28:30,166 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:28:30,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:28:30,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:28:30,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:28:30,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:28:30" (1/1) ... [2019-09-08 13:28:30,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aff19be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:30, skipping insertion in model container [2019-09-08 13:28:30,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:28:30" (1/1) ... [2019-09-08 13:28:30,183 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:28:30,346 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:28:31,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:28:31,974 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:28:32,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:28:32,837 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:28:32,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32 WrapperNode [2019-09-08 13:28:32,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:28:32,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:28:32,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:28:32,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:28:32,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:32,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:32,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:32,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:33,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:33,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (1/1) ... [2019-09-08 13:28:33,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:28:33,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:28:33,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:28:33,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:28:33,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (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:28:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:28:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:28:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:28:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:28:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:28:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:28:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:28:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:28:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:28:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:28:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:28:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:28:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:28:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:28:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:28:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:28:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:28:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:28:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:28:36,155 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:28:36,155 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:28:36,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:28:36 BoogieIcfgContainer [2019-09-08 13:28:36,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:28:36,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:28:36,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:28:36,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:28:36,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:28:30" (1/3) ... [2019-09-08 13:28:36,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cf0123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:28:36, skipping insertion in model container [2019-09-08 13:28:36,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:28:32" (2/3) ... [2019-09-08 13:28:36,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cf0123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:28:36, skipping insertion in model container [2019-09-08 13:28:36,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:28:36" (3/3) ... [2019-09-08 13:28:36,165 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:28:36,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:28:36,185 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:28:36,202 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:28:36,240 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:28:36,241 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:28:36,241 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:28:36,241 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:28:36,241 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:28:36,241 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:28:36,241 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:28:36,242 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:28:36,242 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:28:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states. [2019-09-08 13:28:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:28:36,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:36,320 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] [2019-09-08 13:28:36,322 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1287678275, now seen corresponding path program 1 times [2019-09-08 13:28:36,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:36,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:36,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:36,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:37,370 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:28:37,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:37,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:37,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:37,395 INFO L87 Difference]: Start difference. First operand 992 states. Second operand 3 states. [2019-09-08 13:28:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:37,794 INFO L93 Difference]: Finished difference Result 1726 states and 3059 transitions. [2019-09-08 13:28:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:37,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:28:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:37,836 INFO L225 Difference]: With dead ends: 1726 [2019-09-08 13:28:37,836 INFO L226 Difference]: Without dead ends: 1434 [2019-09-08 13:28:37,848 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:28:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-09-08 13:28:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2019-09-08 13:28:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-08 13:28:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2204 transitions. [2019-09-08 13:28:38,014 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2204 transitions. Word has length 318 [2019-09-08 13:28:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:38,019 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2204 transitions. [2019-09-08 13:28:38,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2204 transitions. [2019-09-08 13:28:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:28:38,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:38,029 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] [2019-09-08 13:28:38,030 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1747906473, now seen corresponding path program 1 times [2019-09-08 13:28:38,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:38,433 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:28:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:38,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:38,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:38,442 INFO L87 Difference]: Start difference. First operand 1432 states and 2204 transitions. Second operand 3 states. [2019-09-08 13:28:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:38,990 INFO L93 Difference]: Finished difference Result 2763 states and 4306 transitions. [2019-09-08 13:28:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:28:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:39,012 INFO L225 Difference]: With dead ends: 2763 [2019-09-08 13:28:39,013 INFO L226 Difference]: Without dead ends: 2408 [2019-09-08 13:28:39,018 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:28:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-09-08 13:28:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2406. [2019-09-08 13:28:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-09-08 13:28:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3730 transitions. [2019-09-08 13:28:39,246 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3730 transitions. Word has length 318 [2019-09-08 13:28:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:39,248 INFO L475 AbstractCegarLoop]: Abstraction has 2406 states and 3730 transitions. [2019-09-08 13:28:39,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3730 transitions. [2019-09-08 13:28:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:28:39,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:39,267 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] [2019-09-08 13:28:39,270 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1748245097, now seen corresponding path program 1 times [2019-09-08 13:28:39,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:39,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:40,377 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:28:40,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:40,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:40,380 INFO L87 Difference]: Start difference. First operand 2406 states and 3730 transitions. Second operand 4 states. [2019-09-08 13:28:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:40,686 INFO L93 Difference]: Finished difference Result 7111 states and 11015 transitions. [2019-09-08 13:28:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:28:40,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 13:28:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:40,717 INFO L225 Difference]: With dead ends: 7111 [2019-09-08 13:28:40,717 INFO L226 Difference]: Without dead ends: 4720 [2019-09-08 13:28:40,725 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:28:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2019-09-08 13:28:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 4565. [2019-09-08 13:28:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-09-08 13:28:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 7066 transitions. [2019-09-08 13:28:40,976 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 7066 transitions. Word has length 318 [2019-09-08 13:28:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:40,977 INFO L475 AbstractCegarLoop]: Abstraction has 4565 states and 7066 transitions. [2019-09-08 13:28:40,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:28:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 7066 transitions. [2019-09-08 13:28:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:28:40,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:40,996 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] [2019-09-08 13:28:40,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1483231033, now seen corresponding path program 1 times [2019-09-08 13:28:40,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:41,320 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:28:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:41,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:41,323 INFO L87 Difference]: Start difference. First operand 4565 states and 7066 transitions. Second operand 3 states. [2019-09-08 13:28:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:41,788 INFO L93 Difference]: Finished difference Result 13394 states and 20686 transitions. [2019-09-08 13:28:41,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:41,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:28:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:41,833 INFO L225 Difference]: With dead ends: 13394 [2019-09-08 13:28:41,833 INFO L226 Difference]: Without dead ends: 8958 [2019-09-08 13:28:41,847 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:28:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-08 13:28:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8803. [2019-09-08 13:28:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8803 states. [2019-09-08 13:28:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8803 states to 8803 states and 13579 transitions. [2019-09-08 13:28:42,304 INFO L78 Accepts]: Start accepts. Automaton has 8803 states and 13579 transitions. Word has length 320 [2019-09-08 13:28:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:42,305 INFO L475 AbstractCegarLoop]: Abstraction has 8803 states and 13579 transitions. [2019-09-08 13:28:42,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8803 states and 13579 transitions. [2019-09-08 13:28:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:28:42,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:42,328 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] [2019-09-08 13:28:42,329 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1608891380, now seen corresponding path program 1 times [2019-09-08 13:28:42,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:42,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:42,558 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:28:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:42,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:42,561 INFO L87 Difference]: Start difference. First operand 8803 states and 13579 transitions. Second operand 3 states. [2019-09-08 13:28:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:43,155 INFO L93 Difference]: Finished difference Result 26334 states and 40613 transitions. [2019-09-08 13:28:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:43,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:28:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:43,227 INFO L225 Difference]: With dead ends: 26334 [2019-09-08 13:28:43,228 INFO L226 Difference]: Without dead ends: 17573 [2019-09-08 13:28:43,250 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:28:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17573 states. [2019-09-08 13:28:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17573 to 8822. [2019-09-08 13:28:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8822 states. [2019-09-08 13:28:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8822 states to 8822 states and 13607 transitions. [2019-09-08 13:28:43,984 INFO L78 Accepts]: Start accepts. Automaton has 8822 states and 13607 transitions. Word has length 320 [2019-09-08 13:28:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:43,984 INFO L475 AbstractCegarLoop]: Abstraction has 8822 states and 13607 transitions. [2019-09-08 13:28:43,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8822 states and 13607 transitions. [2019-09-08 13:28:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:28:44,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:44,009 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] [2019-09-08 13:28:44,010 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash -290238007, now seen corresponding path program 1 times [2019-09-08 13:28:44,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:44,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:44,270 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:28:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:44,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:44,272 INFO L87 Difference]: Start difference. First operand 8822 states and 13607 transitions. Second operand 3 states. [2019-09-08 13:28:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:44,963 INFO L93 Difference]: Finished difference Result 26353 states and 40634 transitions. [2019-09-08 13:28:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:44,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 13:28:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:45,017 INFO L225 Difference]: With dead ends: 26353 [2019-09-08 13:28:45,017 INFO L226 Difference]: Without dead ends: 17591 [2019-09-08 13:28:45,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17591 states. [2019-09-08 13:28:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17591 to 8840. [2019-09-08 13:28:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-08 13:28:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 13628 transitions. [2019-09-08 13:28:45,711 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 13628 transitions. Word has length 321 [2019-09-08 13:28:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:45,711 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 13628 transitions. [2019-09-08 13:28:45,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 13628 transitions. [2019-09-08 13:28:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:28:45,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:45,734 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] [2019-09-08 13:28:45,735 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1939877569, now seen corresponding path program 1 times [2019-09-08 13:28:45,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:45,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:46,130 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:28:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:46,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:46,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:46,133 INFO L87 Difference]: Start difference. First operand 8840 states and 13628 transitions. Second operand 4 states. [2019-09-08 13:28:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:47,707 INFO L93 Difference]: Finished difference Result 26029 states and 40039 transitions. [2019-09-08 13:28:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:28:47,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:28:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:47,749 INFO L225 Difference]: With dead ends: 26029 [2019-09-08 13:28:47,749 INFO L226 Difference]: Without dead ends: 17518 [2019-09-08 13:28:47,766 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:28:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17518 states. [2019-09-08 13:28:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17518 to 9047. [2019-09-08 13:28:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9047 states. [2019-09-08 13:28:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 13981 transitions. [2019-09-08 13:28:48,413 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 13981 transitions. Word has length 322 [2019-09-08 13:28:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:48,413 INFO L475 AbstractCegarLoop]: Abstraction has 9047 states and 13981 transitions. [2019-09-08 13:28:48,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:28:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 13981 transitions. [2019-09-08 13:28:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:28:48,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:48,435 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] [2019-09-08 13:28:48,436 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1116371106, now seen corresponding path program 1 times [2019-09-08 13:28:48,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:48,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:48,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:48,707 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:28:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:48,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:48,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:48,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:48,710 INFO L87 Difference]: Start difference. First operand 9047 states and 13981 transitions. Second operand 3 states. [2019-09-08 13:28:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:49,564 INFO L93 Difference]: Finished difference Result 26108 states and 40181 transitions. [2019-09-08 13:28:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:49,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:28:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:49,622 INFO L225 Difference]: With dead ends: 26108 [2019-09-08 13:28:49,622 INFO L226 Difference]: Without dead ends: 17481 [2019-09-08 13:28:49,652 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:28:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17481 states. [2019-09-08 13:28:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17481 to 17326. [2019-09-08 13:28:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17326 states. [2019-09-08 13:28:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17326 states to 17326 states and 26592 transitions. [2019-09-08 13:28:50,707 INFO L78 Accepts]: Start accepts. Automaton has 17326 states and 26592 transitions. Word has length 322 [2019-09-08 13:28:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:50,708 INFO L475 AbstractCegarLoop]: Abstraction has 17326 states and 26592 transitions. [2019-09-08 13:28:50,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17326 states and 26592 transitions. [2019-09-08 13:28:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:28:50,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:50,767 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] [2019-09-08 13:28:50,767 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash -810014832, now seen corresponding path program 1 times [2019-09-08 13:28:50,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:50,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:51,096 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:28:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:51,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:51,099 INFO L87 Difference]: Start difference. First operand 17326 states and 26592 transitions. Second operand 3 states. [2019-09-08 13:28:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:52,445 INFO L93 Difference]: Finished difference Result 50408 states and 77057 transitions. [2019-09-08 13:28:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:52,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:28:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:52,527 INFO L225 Difference]: With dead ends: 50408 [2019-09-08 13:28:52,527 INFO L226 Difference]: Without dead ends: 33885 [2019-09-08 13:28:52,568 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:28:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33885 states. [2019-09-08 13:28:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33885 to 17430. [2019-09-08 13:28:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17430 states. [2019-09-08 13:28:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17430 states to 17430 states and 26735 transitions. [2019-09-08 13:28:53,951 INFO L78 Accepts]: Start accepts. Automaton has 17430 states and 26735 transitions. Word has length 324 [2019-09-08 13:28:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:53,951 INFO L475 AbstractCegarLoop]: Abstraction has 17430 states and 26735 transitions. [2019-09-08 13:28:53,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17430 states and 26735 transitions. [2019-09-08 13:28:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:28:53,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:53,994 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] [2019-09-08 13:28:53,995 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash -902236738, now seen corresponding path program 1 times [2019-09-08 13:28:53,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:54,228 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:28:54,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:54,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:54,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:54,231 INFO L87 Difference]: Start difference. First operand 17430 states and 26735 transitions. Second operand 3 states. [2019-09-08 13:28:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:55,596 INFO L93 Difference]: Finished difference Result 42243 states and 65169 transitions. [2019-09-08 13:28:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:55,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:28:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:55,663 INFO L225 Difference]: With dead ends: 42243 [2019-09-08 13:28:55,663 INFO L226 Difference]: Without dead ends: 26680 [2019-09-08 13:28:55,698 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:28:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26680 states. [2019-09-08 13:28:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26680 to 21334. [2019-09-08 13:28:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21334 states. [2019-09-08 13:28:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21334 states to 21334 states and 33179 transitions. [2019-09-08 13:28:57,326 INFO L78 Accepts]: Start accepts. Automaton has 21334 states and 33179 transitions. Word has length 324 [2019-09-08 13:28:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:57,327 INFO L475 AbstractCegarLoop]: Abstraction has 21334 states and 33179 transitions. [2019-09-08 13:28:57,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21334 states and 33179 transitions. [2019-09-08 13:28:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 13:28:57,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:57,353 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] [2019-09-08 13:28:57,354 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1240426541, now seen corresponding path program 1 times [2019-09-08 13:28:57,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:57,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:57,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:57,502 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:28:57,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:57,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:57,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:57,504 INFO L87 Difference]: Start difference. First operand 21334 states and 33179 transitions. Second operand 3 states. [2019-09-08 13:28:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:59,286 INFO L93 Difference]: Finished difference Result 62252 states and 96555 transitions. [2019-09-08 13:28:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:59,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 13:28:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:59,349 INFO L225 Difference]: With dead ends: 62252 [2019-09-08 13:28:59,349 INFO L226 Difference]: Without dead ends: 41818 [2019-09-08 13:28:59,380 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:28:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41818 states. [2019-09-08 13:29:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41818 to 21459. [2019-09-08 13:29:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21459 states. [2019-09-08 13:29:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 33325 transitions. [2019-09-08 13:29:00,736 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 33325 transitions. Word has length 325 [2019-09-08 13:29:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:00,736 INFO L475 AbstractCegarLoop]: Abstraction has 21459 states and 33325 transitions. [2019-09-08 13:29:00,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 33325 transitions. [2019-09-08 13:29:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:29:00,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:00,749 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] [2019-09-08 13:29:00,750 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash -797625659, now seen corresponding path program 1 times [2019-09-08 13:29:00,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:00,958 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:29:00,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:00,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:00,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:00,961 INFO L87 Difference]: Start difference. First operand 21459 states and 33325 transitions. Second operand 3 states. [2019-09-08 13:29:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:03,015 INFO L93 Difference]: Finished difference Result 51928 states and 81347 transitions. [2019-09-08 13:29:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:03,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:29:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:03,055 INFO L225 Difference]: With dead ends: 51928 [2019-09-08 13:29:03,055 INFO L226 Difference]: Without dead ends: 32773 [2019-09-08 13:29:03,077 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:29:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32773 states. [2019-09-08 13:29:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32773 to 28467. [2019-09-08 13:29:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28467 states. [2019-09-08 13:29:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28467 states to 28467 states and 44825 transitions. [2019-09-08 13:29:04,281 INFO L78 Accepts]: Start accepts. Automaton has 28467 states and 44825 transitions. Word has length 326 [2019-09-08 13:29:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:04,282 INFO L475 AbstractCegarLoop]: Abstraction has 28467 states and 44825 transitions. [2019-09-08 13:29:04,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28467 states and 44825 transitions. [2019-09-08 13:29:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:29:04,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:04,294 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] [2019-09-08 13:29:04,294 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -880682557, now seen corresponding path program 1 times [2019-09-08 13:29:04,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:04,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:04,734 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:29:04,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:04,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:04,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:04,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:04,737 INFO L87 Difference]: Start difference. First operand 28467 states and 44825 transitions. Second operand 4 states. [2019-09-08 13:29:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:05,856 INFO L93 Difference]: Finished difference Result 52738 states and 82911 transitions. [2019-09-08 13:29:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:05,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 13:29:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:05,893 INFO L225 Difference]: With dead ends: 52738 [2019-09-08 13:29:05,893 INFO L226 Difference]: Without dead ends: 25134 [2019-09-08 13:29:05,930 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:29:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25134 states. [2019-09-08 13:29:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25134 to 25114. [2019-09-08 13:29:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25114 states. [2019-09-08 13:29:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25114 states to 25114 states and 39503 transitions. [2019-09-08 13:29:07,251 INFO L78 Accepts]: Start accepts. Automaton has 25114 states and 39503 transitions. Word has length 326 [2019-09-08 13:29:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:07,251 INFO L475 AbstractCegarLoop]: Abstraction has 25114 states and 39503 transitions. [2019-09-08 13:29:07,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25114 states and 39503 transitions. [2019-09-08 13:29:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:07,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:07,267 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] [2019-09-08 13:29:07,268 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash 47073857, now seen corresponding path program 1 times [2019-09-08 13:29:07,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:07,693 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:29:07,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:07,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:29:07,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:29:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:29:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:07,697 INFO L87 Difference]: Start difference. First operand 25114 states and 39503 transitions. Second operand 5 states. [2019-09-08 13:29:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:09,811 INFO L93 Difference]: Finished difference Result 48522 states and 76357 transitions. [2019-09-08 13:29:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:29:09,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-09-08 13:29:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:09,840 INFO L225 Difference]: With dead ends: 48522 [2019-09-08 13:29:09,840 INFO L226 Difference]: Without dead ends: 25116 [2019-09-08 13:29:09,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:29:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25116 states. [2019-09-08 13:29:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25116 to 25114. [2019-09-08 13:29:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25114 states. [2019-09-08 13:29:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25114 states to 25114 states and 39341 transitions. [2019-09-08 13:29:11,764 INFO L78 Accepts]: Start accepts. Automaton has 25114 states and 39341 transitions. Word has length 327 [2019-09-08 13:29:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:11,764 INFO L475 AbstractCegarLoop]: Abstraction has 25114 states and 39341 transitions. [2019-09-08 13:29:11,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:29:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 25114 states and 39341 transitions. [2019-09-08 13:29:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:11,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:11,780 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] [2019-09-08 13:29:11,780 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1819119044, now seen corresponding path program 1 times [2019-09-08 13:29:11,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:11,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:12,231 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:29:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:29:12,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:29:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:29:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:29:12,233 INFO L87 Difference]: Start difference. First operand 25114 states and 39341 transitions. Second operand 8 states. [2019-09-08 13:29:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:21,942 INFO L93 Difference]: Finished difference Result 142629 states and 226742 transitions. [2019-09-08 13:29:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 13:29:21,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-09-08 13:29:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:22,100 INFO L225 Difference]: With dead ends: 142629 [2019-09-08 13:29:22,100 INFO L226 Difference]: Without dead ends: 129062 [2019-09-08 13:29:22,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-08 13:29:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129062 states. [2019-09-08 13:29:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129062 to 63962. [2019-09-08 13:29:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63962 states. [2019-09-08 13:29:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63962 states to 63962 states and 99672 transitions. [2019-09-08 13:29:27,315 INFO L78 Accepts]: Start accepts. Automaton has 63962 states and 99672 transitions. Word has length 327 [2019-09-08 13:29:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:27,315 INFO L475 AbstractCegarLoop]: Abstraction has 63962 states and 99672 transitions. [2019-09-08 13:29:27,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:29:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63962 states and 99672 transitions. [2019-09-08 13:29:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:27,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:27,346 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] [2019-09-08 13:29:27,347 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -443227393, now seen corresponding path program 1 times [2019-09-08 13:29:27,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:27,872 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:29:27,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:27,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:27,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:27,876 INFO L87 Difference]: Start difference. First operand 63962 states and 99672 transitions. Second operand 3 states. [2019-09-08 13:29:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:35,929 INFO L93 Difference]: Finished difference Result 160136 states and 252408 transitions. [2019-09-08 13:29:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:35,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:29:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:36,061 INFO L225 Difference]: With dead ends: 160136 [2019-09-08 13:29:36,061 INFO L226 Difference]: Without dead ends: 122888 [2019-09-08 13:29:36,097 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:29:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122888 states. [2019-09-08 13:29:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122888 to 122772. [2019-09-08 13:29:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122772 states. [2019-09-08 13:29:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122772 states to 122772 states and 191466 transitions. [2019-09-08 13:29:42,965 INFO L78 Accepts]: Start accepts. Automaton has 122772 states and 191466 transitions. Word has length 327 [2019-09-08 13:29:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:42,965 INFO L475 AbstractCegarLoop]: Abstraction has 122772 states and 191466 transitions. [2019-09-08 13:29:42,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 122772 states and 191466 transitions. [2019-09-08 13:29:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:43,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:43,012 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] [2019-09-08 13:29:43,013 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2072896260, now seen corresponding path program 1 times [2019-09-08 13:29:43,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:43,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:43,511 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:29:43,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:43,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:29:43,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:29:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:29:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:29:43,514 INFO L87 Difference]: Start difference. First operand 122772 states and 191466 transitions. Second operand 9 states. [2019-09-08 13:29:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:54,862 INFO L93 Difference]: Finished difference Result 237950 states and 374184 transitions. [2019-09-08 13:29:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:29:54,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-08 13:29:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:55,038 INFO L225 Difference]: With dead ends: 237950 [2019-09-08 13:29:55,038 INFO L226 Difference]: Without dead ends: 117636 [2019-09-08 13:29:55,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:29:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117636 states. [2019-09-08 13:29:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117636 to 62622. [2019-09-08 13:29:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62622 states. [2019-09-08 13:29:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62622 states to 62622 states and 96142 transitions. [2019-09-08 13:29:59,648 INFO L78 Accepts]: Start accepts. Automaton has 62622 states and 96142 transitions. Word has length 327 [2019-09-08 13:29:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:59,648 INFO L475 AbstractCegarLoop]: Abstraction has 62622 states and 96142 transitions. [2019-09-08 13:29:59,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:29:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 62622 states and 96142 transitions. [2019-09-08 13:29:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:59,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:59,678 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] [2019-09-08 13:29:59,678 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:59,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:59,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1131631352, now seen corresponding path program 1 times [2019-09-08 13:29:59,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:59,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:59,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:59,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:59,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:00,370 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:30:00,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:00,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:00,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:00,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:00,373 INFO L87 Difference]: Start difference. First operand 62622 states and 96142 transitions. Second operand 4 states. [2019-09-08 13:30:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:10,073 INFO L93 Difference]: Finished difference Result 184639 states and 283591 transitions. [2019-09-08 13:30:10,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:10,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-08 13:30:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:10,213 INFO L225 Difference]: With dead ends: 184639 [2019-09-08 13:30:10,213 INFO L226 Difference]: Without dead ends: 122089 [2019-09-08 13:30:10,266 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:30:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122089 states. [2019-09-08 13:30:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122089 to 121914. [2019-09-08 13:30:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121914 states. [2019-09-08 13:30:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121914 states to 121914 states and 186510 transitions. [2019-09-08 13:30:18,032 INFO L78 Accepts]: Start accepts. Automaton has 121914 states and 186510 transitions. Word has length 327 [2019-09-08 13:30:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:18,033 INFO L475 AbstractCegarLoop]: Abstraction has 121914 states and 186510 transitions. [2019-09-08 13:30:18,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 121914 states and 186510 transitions. [2019-09-08 13:30:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:30:18,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:18,081 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] [2019-09-08 13:30:18,082 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:18,082 INFO L82 PathProgramCache]: Analyzing trace with hash -532511749, now seen corresponding path program 1 times [2019-09-08 13:30:18,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:18,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:18,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:18,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:18,310 INFO L87 Difference]: Start difference. First operand 121914 states and 186510 transitions. Second operand 3 states. [2019-09-08 13:30:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:35,031 INFO L93 Difference]: Finished difference Result 358570 states and 548552 transitions. [2019-09-08 13:30:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:35,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:30:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:35,406 INFO L225 Difference]: With dead ends: 358570 [2019-09-08 13:30:35,406 INFO L226 Difference]: Without dead ends: 237905 [2019-09-08 13:30:35,526 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:30:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237905 states. [2019-09-08 13:30:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237905 to 237738. [2019-09-08 13:30:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237738 states. [2019-09-08 13:30:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237738 states to 237738 states and 362336 transitions. [2019-09-08 13:30:55,095 INFO L78 Accepts]: Start accepts. Automaton has 237738 states and 362336 transitions. Word has length 329 [2019-09-08 13:30:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:55,096 INFO L475 AbstractCegarLoop]: Abstraction has 237738 states and 362336 transitions. [2019-09-08 13:30:55,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 237738 states and 362336 transitions. [2019-09-08 13:30:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:30:55,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:55,186 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] [2019-09-08 13:30:55,186 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1923708690, now seen corresponding path program 1 times [2019-09-08 13:30:55,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:55,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:55,354 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:30:55,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:55,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:55,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:55,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:55,356 INFO L87 Difference]: Start difference. First operand 237738 states and 362336 transitions. Second operand 3 states. [2019-09-08 13:31:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:25,831 INFO L93 Difference]: Finished difference Result 622468 states and 956513 transitions. [2019-09-08 13:31:25,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:25,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:31:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:26,389 INFO L225 Difference]: With dead ends: 622468 [2019-09-08 13:31:26,390 INFO L226 Difference]: Without dead ends: 391919 [2019-09-08 13:31:26,574 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:31:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391919 states. [2019-09-08 13:31:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391919 to 354730. [2019-09-08 13:31:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354730 states. [2019-09-08 13:31:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354730 states to 354730 states and 545384 transitions. [2019-09-08 13:31:58,690 INFO L78 Accepts]: Start accepts. Automaton has 354730 states and 545384 transitions. Word has length 330 [2019-09-08 13:31:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:58,690 INFO L475 AbstractCegarLoop]: Abstraction has 354730 states and 545384 transitions. [2019-09-08 13:31:58,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 354730 states and 545384 transitions. [2019-09-08 13:31:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:31:58,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:58,787 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] [2019-09-08 13:31:58,787 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1189850304, now seen corresponding path program 1 times [2019-09-08 13:31:58,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:58,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:59,050 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:31:59,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:59,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:59,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:59,052 INFO L87 Difference]: Start difference. First operand 354730 states and 545384 transitions. Second operand 3 states. [2019-09-08 13:32:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:56,205 INFO L93 Difference]: Finished difference Result 1009616 states and 1550780 transitions. [2019-09-08 13:32:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:56,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:32:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:57,825 INFO L225 Difference]: With dead ends: 1009616 [2019-09-08 13:32:57,825 INFO L226 Difference]: Without dead ends: 656233 [2019-09-08 13:32:58,140 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:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656233 states. [2019-09-08 13:34:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656233 to 656074. [2019-09-08 13:34:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656074 states. [2019-09-08 13:34:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656074 states to 656074 states and 1001797 transitions. [2019-09-08 13:34:07,709 INFO L78 Accepts]: Start accepts. Automaton has 656074 states and 1001797 transitions. Word has length 331 [2019-09-08 13:34:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:07,710 INFO L475 AbstractCegarLoop]: Abstraction has 656074 states and 1001797 transitions. [2019-09-08 13:34:07,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:34:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 656074 states and 1001797 transitions. [2019-09-08 13:34:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:34:07,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:07,879 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] [2019-09-08 13:34:07,880 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1037795325, now seen corresponding path program 1 times [2019-09-08 13:34:07,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:07,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:07,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:08,206 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:08,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:08,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:34:08,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:34:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:34:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:34:08,208 INFO L87 Difference]: Start difference. First operand 656074 states and 1001797 transitions. Second operand 4 states. [2019-09-08 13:35:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:35:58,729 INFO L93 Difference]: Finished difference Result 1828500 states and 2788090 transitions. [2019-09-08 13:35:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:35:58,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-08 13:35:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:00,759 INFO L225 Difference]: With dead ends: 1828500 [2019-09-08 13:36:00,760 INFO L226 Difference]: Without dead ends: 1175718 [2019-09-08 13:36:02,137 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:36:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175718 states. [2019-09-08 13:37:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175718 to 643677. [2019-09-08 13:37:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643677 states. [2019-09-08 13:37:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643677 states to 643677 states and 982405 transitions. [2019-09-08 13:37:29,278 INFO L78 Accepts]: Start accepts. Automaton has 643677 states and 982405 transitions. Word has length 331 [2019-09-08 13:37:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:29,278 INFO L475 AbstractCegarLoop]: Abstraction has 643677 states and 982405 transitions. [2019-09-08 13:37:29,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 643677 states and 982405 transitions. [2019-09-08 13:37:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:37:29,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:29,461 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] [2019-09-08 13:37:29,461 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1442843131, now seen corresponding path program 1 times [2019-09-08 13:37:29,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:29,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:29,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:29,603 INFO L87 Difference]: Start difference. First operand 643677 states and 982405 transitions. Second operand 3 states. [2019-09-08 13:39:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:18,285 INFO L93 Difference]: Finished difference Result 1771863 states and 2701724 transitions. [2019-09-08 13:39:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:18,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-08 13:39:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:20,120 INFO L225 Difference]: With dead ends: 1771863 [2019-09-08 13:39:20,120 INFO L226 Difference]: Without dead ends: 1150330 [2019-09-08 13:39:20,610 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:39:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150330 states.