java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:40:30,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:40:30,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:40:30,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:40:30,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:40:30,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:40:30,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:40:30,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:40:30,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:40:30,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:40:30,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:40:30,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:40:30,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:40:30,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:40:30,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:40:30,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:40:30,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:40:30,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:40:30,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:40:30,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:40:30,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:40:30,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:40:30,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:40:30,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:40:30,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:40:30,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:40:30,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:40:30,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:40:30,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:40:30,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:40:30,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:40:30,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:40:30,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:40:30,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:40:30,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:40:30,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:40:30,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:40:30,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:40:30,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:40:30,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:40:30,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:40:30,503 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:40:30,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:40:30,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:40:30,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:40:30,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:40:30,526 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:40:30,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:40:30,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:40:30,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:40:30,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:40:30,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:40:30,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:40:30,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:40:30,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:40:30,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:40:30,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:40:30,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:40:30,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:40:30,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:40:30,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:40:30,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:40:30,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:40:30,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:40:30,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:40:30,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:40:30,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:40:30,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:40:30,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:40:30,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:40:30,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:40:30,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:40:30,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:40:30,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:40:30,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:40:30,587 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:40:30,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:40:30,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178339092/1c35adbc6ffd44069c37b36b7d92d878/FLAG79c92b1ce [2019-09-08 13:40:31,394 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:40:31,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:40:31,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178339092/1c35adbc6ffd44069c37b36b7d92d878/FLAG79c92b1ce [2019-09-08 13:40:31,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178339092/1c35adbc6ffd44069c37b36b7d92d878 [2019-09-08 13:40:31,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:40:31,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:40:31,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:40:31,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:40:31,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:40:31,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:40:31" (1/1) ... [2019-09-08 13:40:31,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e31ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:31, skipping insertion in model container [2019-09-08 13:40:31,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:40:31" (1/1) ... [2019-09-08 13:40:31,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:40:31,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:40:32,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:40:32,879 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:40:33,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:40:33,624 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:40:33,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33 WrapperNode [2019-09-08 13:40:33,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:40:33,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:40:33,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:40:33,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:40:33,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (1/1) ... [2019-09-08 13:40:33,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:40:33,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:40:33,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:40:33,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:40:33,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (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:40:34,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:40:34,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:40:34,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:40:34,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:40:34,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:40:34,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:40:34,014 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:40:34,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:40:34,014 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:40:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:40:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:40:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:40:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:40:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:40:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:40:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:40:34,021 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:40:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:40:34,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:40:34,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:40:38,247 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:40:38,247 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:40:38,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:40:38 BoogieIcfgContainer [2019-09-08 13:40:38,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:40:38,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:40:38,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:40:38,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:40:38,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:40:31" (1/3) ... [2019-09-08 13:40:38,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe0eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:40:38, skipping insertion in model container [2019-09-08 13:40:38,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:33" (2/3) ... [2019-09-08 13:40:38,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe0eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:40:38, skipping insertion in model container [2019-09-08 13:40:38,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:40:38" (3/3) ... [2019-09-08 13:40:38,264 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 13:40:38,275 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:40:38,299 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:40:38,315 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:40:38,359 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:40:38,360 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:40:38,360 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:40:38,360 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:40:38,361 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:40:38,361 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:40:38,361 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:40:38,361 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:40:38,361 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:40:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states. [2019-09-08 13:40:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:40:38,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:38,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:38,467 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1298916417, now seen corresponding path program 1 times [2019-09-08 13:40:38,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:38,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:38,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:39,396 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:40:39,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:39,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:39,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:39,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:39,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:39,419 INFO L87 Difference]: Start difference. First operand 1549 states. Second operand 3 states. [2019-09-08 13:40:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:39,791 INFO L93 Difference]: Finished difference Result 2999 states and 5237 transitions. [2019-09-08 13:40:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:39,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:40:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:39,831 INFO L225 Difference]: With dead ends: 2999 [2019-09-08 13:40:39,831 INFO L226 Difference]: Without dead ends: 2098 [2019-09-08 13:40:39,844 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:40:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-09-08 13:40:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2096. [2019-09-08 13:40:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-08 13:40:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3504 transitions. [2019-09-08 13:40:40,024 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3504 transitions. Word has length 391 [2019-09-08 13:40:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:40,029 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3504 transitions. [2019-09-08 13:40:40,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3504 transitions. [2019-09-08 13:40:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:40:40,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:40,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:40,044 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -163588012, now seen corresponding path program 1 times [2019-09-08 13:40:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:40,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:40,551 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:40:40,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:40,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:40,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:40,557 INFO L87 Difference]: Start difference. First operand 2096 states and 3504 transitions. Second operand 3 states. [2019-09-08 13:40:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:40,710 INFO L93 Difference]: Finished difference Result 4396 states and 7271 transitions. [2019-09-08 13:40:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:40,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:40:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:40,729 INFO L225 Difference]: With dead ends: 4396 [2019-09-08 13:40:40,729 INFO L226 Difference]: Without dead ends: 3022 [2019-09-08 13:40:40,734 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:40:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-08 13:40:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3020. [2019-09-08 13:40:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-09-08 13:40:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 5011 transitions. [2019-09-08 13:40:40,855 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 5011 transitions. Word has length 391 [2019-09-08 13:40:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:40,855 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 5011 transitions. [2019-09-08 13:40:40,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 5011 transitions. [2019-09-08 13:40:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:40:40,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:40,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:40,868 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash -890084695, now seen corresponding path program 1 times [2019-09-08 13:40:40,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:40,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:41,380 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:40:41,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:41,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:40:41,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:40:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:40:41,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:41,383 INFO L87 Difference]: Start difference. First operand 3020 states and 5011 transitions. Second operand 4 states. [2019-09-08 13:40:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:41,622 INFO L93 Difference]: Finished difference Result 4810 states and 8021 transitions. [2019-09-08 13:40:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:40:41,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-08 13:40:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:41,651 INFO L225 Difference]: With dead ends: 4810 [2019-09-08 13:40:41,653 INFO L226 Difference]: Without dead ends: 4088 [2019-09-08 13:40:41,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-09-08 13:40:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 3346. [2019-09-08 13:40:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-09-08 13:40:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5565 transitions. [2019-09-08 13:40:41,833 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5565 transitions. Word has length 391 [2019-09-08 13:40:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:41,834 INFO L475 AbstractCegarLoop]: Abstraction has 3346 states and 5565 transitions. [2019-09-08 13:40:41,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5565 transitions. [2019-09-08 13:40:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:40:41,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:41,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:41,845 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2110188570, now seen corresponding path program 1 times [2019-09-08 13:40:41,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:41,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:42,570 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:40:42,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:42,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:42,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:42,573 INFO L87 Difference]: Start difference. First operand 3346 states and 5565 transitions. Second operand 3 states. [2019-09-08 13:40:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:42,943 INFO L93 Difference]: Finished difference Result 5776 states and 9657 transitions. [2019-09-08 13:40:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:42,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:40:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:42,972 INFO L225 Difference]: With dead ends: 5776 [2019-09-08 13:40:42,973 INFO L226 Difference]: Without dead ends: 4728 [2019-09-08 13:40:42,980 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:40:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-09-08 13:40:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 4726. [2019-09-08 13:40:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4726 states. [2019-09-08 13:40:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4726 states to 4726 states and 7867 transitions. [2019-09-08 13:40:43,249 INFO L78 Accepts]: Start accepts. Automaton has 4726 states and 7867 transitions. Word has length 391 [2019-09-08 13:40:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:43,250 INFO L475 AbstractCegarLoop]: Abstraction has 4726 states and 7867 transitions. [2019-09-08 13:40:43,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4726 states and 7867 transitions. [2019-09-08 13:40:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:40:43,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:43,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:43,264 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash 309299619, now seen corresponding path program 1 times [2019-09-08 13:40:43,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:43,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:43,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:44,235 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:40:44,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:44,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:40:44,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:40:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:40:44,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:40:44,238 INFO L87 Difference]: Start difference. First operand 4726 states and 7867 transitions. Second operand 5 states. [2019-09-08 13:40:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:44,888 INFO L93 Difference]: Finished difference Result 13630 states and 22841 transitions. [2019-09-08 13:40:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:40:44,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-09-08 13:40:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:44,965 INFO L225 Difference]: With dead ends: 13630 [2019-09-08 13:40:44,965 INFO L226 Difference]: Without dead ends: 11614 [2019-09-08 13:40:44,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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:40:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2019-09-08 13:40:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 8922. [2019-09-08 13:40:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8922 states. [2019-09-08 13:40:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8922 states to 8922 states and 14905 transitions. [2019-09-08 13:40:45,509 INFO L78 Accepts]: Start accepts. Automaton has 8922 states and 14905 transitions. Word has length 392 [2019-09-08 13:40:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:45,510 INFO L475 AbstractCegarLoop]: Abstraction has 8922 states and 14905 transitions. [2019-09-08 13:40:45,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:40:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8922 states and 14905 transitions. [2019-09-08 13:40:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:40:45,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:45,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:45,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1339273494, now seen corresponding path program 1 times [2019-09-08 13:40:45,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:45,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:45,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:45,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:45,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:46,938 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:40:46,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:46,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:40:46,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:40:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:40:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:46,940 INFO L87 Difference]: Start difference. First operand 8922 states and 14905 transitions. Second operand 4 states. [2019-09-08 13:40:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:47,987 INFO L93 Difference]: Finished difference Result 28972 states and 48386 transitions. [2019-09-08 13:40:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:40:47,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-08 13:40:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:48,046 INFO L225 Difference]: With dead ends: 28972 [2019-09-08 13:40:48,046 INFO L226 Difference]: Without dead ends: 22248 [2019-09-08 13:40:48,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:40:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22248 states. [2019-09-08 13:40:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22248 to 16948. [2019-09-08 13:40:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16948 states. [2019-09-08 13:40:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16948 states to 16948 states and 28209 transitions. [2019-09-08 13:40:49,001 INFO L78 Accepts]: Start accepts. Automaton has 16948 states and 28209 transitions. Word has length 393 [2019-09-08 13:40:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:49,003 INFO L475 AbstractCegarLoop]: Abstraction has 16948 states and 28209 transitions. [2019-09-08 13:40:49,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16948 states and 28209 transitions. [2019-09-08 13:40:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:40:49,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:49,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:49,040 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 415719592, now seen corresponding path program 1 times [2019-09-08 13:40:49,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:49,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:49,927 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:40:49,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:49,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:49,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:49,930 INFO L87 Difference]: Start difference. First operand 16948 states and 28209 transitions. Second operand 3 states. [2019-09-08 13:40:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:51,139 INFO L93 Difference]: Finished difference Result 47658 states and 79059 transitions. [2019-09-08 13:40:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:51,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-08 13:40:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:51,398 INFO L225 Difference]: With dead ends: 47658 [2019-09-08 13:40:51,398 INFO L226 Difference]: Without dead ends: 31884 [2019-09-08 13:40:51,432 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:40:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31884 states. [2019-09-08 13:40:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31884 to 29126. [2019-09-08 13:40:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29126 states. [2019-09-08 13:40:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29126 states to 29126 states and 48187 transitions. [2019-09-08 13:40:52,610 INFO L78 Accepts]: Start accepts. Automaton has 29126 states and 48187 transitions. Word has length 393 [2019-09-08 13:40:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:52,611 INFO L475 AbstractCegarLoop]: Abstraction has 29126 states and 48187 transitions. [2019-09-08 13:40:52,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29126 states and 48187 transitions. [2019-09-08 13:40:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:40:52,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:52,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:52,641 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1945548778, now seen corresponding path program 1 times [2019-09-08 13:40:52,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:52,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:52,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:53,916 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:40:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:53,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:53,919 INFO L87 Difference]: Start difference. First operand 29126 states and 48187 transitions. Second operand 3 states. [2019-09-08 13:40:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:54,600 INFO L93 Difference]: Finished difference Result 52562 states and 87245 transitions. [2019-09-08 13:40:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:54,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-09-08 13:40:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:54,677 INFO L225 Difference]: With dead ends: 52562 [2019-09-08 13:40:54,677 INFO L226 Difference]: Without dead ends: 25624 [2019-09-08 13:40:54,749 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:40:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25624 states. [2019-09-08 13:40:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25624 to 25622. [2019-09-08 13:40:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25622 states. [2019-09-08 13:40:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25622 states to 25622 states and 42503 transitions. [2019-09-08 13:40:55,888 INFO L78 Accepts]: Start accepts. Automaton has 25622 states and 42503 transitions. Word has length 393 [2019-09-08 13:40:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:55,889 INFO L475 AbstractCegarLoop]: Abstraction has 25622 states and 42503 transitions. [2019-09-08 13:40:55,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25622 states and 42503 transitions. [2019-09-08 13:40:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:40:55,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:55,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:55,902 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -589180482, now seen corresponding path program 1 times [2019-09-08 13:40:55,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:56,609 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:40:56,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:40:56,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:40:56,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:40:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:40:56,611 INFO L87 Difference]: Start difference. First operand 25622 states and 42503 transitions. Second operand 6 states. [2019-09-08 13:40:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:58,846 INFO L93 Difference]: Finished difference Result 80562 states and 134099 transitions. [2019-09-08 13:40:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:40:58,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 393 [2019-09-08 13:40:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:59,019 INFO L225 Difference]: With dead ends: 80562 [2019-09-08 13:40:59,020 INFO L226 Difference]: Without dead ends: 59536 [2019-09-08 13:40:59,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:40:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59536 states. [2019-09-08 13:41:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59536 to 58138. [2019-09-08 13:41:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58138 states. [2019-09-08 13:41:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58138 states to 58138 states and 96679 transitions. [2019-09-08 13:41:03,169 INFO L78 Accepts]: Start accepts. Automaton has 58138 states and 96679 transitions. Word has length 393 [2019-09-08 13:41:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:03,170 INFO L475 AbstractCegarLoop]: Abstraction has 58138 states and 96679 transitions. [2019-09-08 13:41:03,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:41:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 58138 states and 96679 transitions. [2019-09-08 13:41:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:41:03,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:03,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:03,183 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -684025065, now seen corresponding path program 1 times [2019-09-08 13:41:03,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:03,576 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:41:03,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:03,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:41:03,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:41:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:41:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:41:03,580 INFO L87 Difference]: Start difference. First operand 58138 states and 96679 transitions. Second operand 5 states. [2019-09-08 13:41:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:11,616 INFO L93 Difference]: Finished difference Result 270426 states and 450233 transitions. [2019-09-08 13:41:11,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:41:11,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2019-09-08 13:41:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:12,208 INFO L225 Difference]: With dead ends: 270426 [2019-09-08 13:41:12,209 INFO L226 Difference]: Without dead ends: 216892 [2019-09-08 13:41:12,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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:41:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216892 states. [2019-09-08 13:41:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216892 to 162970. [2019-09-08 13:41:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162970 states. [2019-09-08 13:41:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162970 states to 162970 states and 270575 transitions. [2019-09-08 13:41:18,739 INFO L78 Accepts]: Start accepts. Automaton has 162970 states and 270575 transitions. Word has length 393 [2019-09-08 13:41:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:18,740 INFO L475 AbstractCegarLoop]: Abstraction has 162970 states and 270575 transitions. [2019-09-08 13:41:18,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:41:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 162970 states and 270575 transitions. [2019-09-08 13:41:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 13:41:18,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:18,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:18,753 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -740359979, now seen corresponding path program 1 times [2019-09-08 13:41:18,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:21,939 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:41:21,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:21,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:41:21,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:41:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:41:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:21,941 INFO L87 Difference]: Start difference. First operand 162970 states and 270575 transitions. Second operand 4 states. [2019-09-08 13:41:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:36,112 INFO L93 Difference]: Finished difference Result 489032 states and 811986 transitions. [2019-09-08 13:41:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:41:36,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-09-08 13:41:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:36,807 INFO L225 Difference]: With dead ends: 489032 [2019-09-08 13:41:36,808 INFO L226 Difference]: Without dead ends: 330906 [2019-09-08 13:41:36,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330906 states. [2019-09-08 13:41:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330906 to 273274. [2019-09-08 13:41:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273274 states. [2019-09-08 13:41:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273274 states to 273274 states and 453383 transitions. [2019-09-08 13:41:51,644 INFO L78 Accepts]: Start accepts. Automaton has 273274 states and 453383 transitions. Word has length 393 [2019-09-08 13:41:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:51,645 INFO L475 AbstractCegarLoop]: Abstraction has 273274 states and 453383 transitions. [2019-09-08 13:41:51,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:41:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 273274 states and 453383 transitions. [2019-09-08 13:41:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 13:41:51,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:51,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:51,657 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1490887639, now seen corresponding path program 1 times [2019-09-08 13:41:51,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:52,068 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:41:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:41:52,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:41:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:41:52,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:41:52,071 INFO L87 Difference]: Start difference. First operand 273274 states and 453383 transitions. Second operand 3 states. [2019-09-08 13:42:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:00,964 INFO L93 Difference]: Finished difference Result 350900 states and 582685 transitions. [2019-09-08 13:42:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:42:00,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 397 [2019-09-08 13:42:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:01,121 INFO L225 Difference]: With dead ends: 350900 [2019-09-08 13:42:01,121 INFO L226 Difference]: Without dead ends: 80722 [2019-09-08 13:42:01,385 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:42:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80722 states. [2019-09-08 13:42:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80722 to 57846. [2019-09-08 13:42:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57846 states. [2019-09-08 13:42:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57846 states to 57846 states and 96029 transitions. [2019-09-08 13:42:03,892 INFO L78 Accepts]: Start accepts. Automaton has 57846 states and 96029 transitions. Word has length 397 [2019-09-08 13:42:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:03,893 INFO L475 AbstractCegarLoop]: Abstraction has 57846 states and 96029 transitions. [2019-09-08 13:42:03,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:42:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 57846 states and 96029 transitions. [2019-09-08 13:42:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-08 13:42:03,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:03,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:03,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2065095072, now seen corresponding path program 1 times [2019-09-08 13:42:03,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:03,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:04,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:04,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:42:04,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:42:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:42:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:42:04,436 INFO L87 Difference]: Start difference. First operand 57846 states and 96029 transitions. Second operand 7 states. [2019-09-08 13:42:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:07,652 INFO L93 Difference]: Finished difference Result 122786 states and 203987 transitions. [2019-09-08 13:42:07,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:42:07,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 397 [2019-09-08 13:42:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:07,748 INFO L225 Difference]: With dead ends: 122786 [2019-09-08 13:42:07,748 INFO L226 Difference]: Without dead ends: 68036 [2019-09-08 13:42:07,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:42:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68036 states. [2019-09-08 13:42:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68036 to 60414. [2019-09-08 13:42:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60414 states. [2019-09-08 13:42:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60414 states to 60414 states and 100309 transitions. [2019-09-08 13:42:10,649 INFO L78 Accepts]: Start accepts. Automaton has 60414 states and 100309 transitions. Word has length 397 [2019-09-08 13:42:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:10,650 INFO L475 AbstractCegarLoop]: Abstraction has 60414 states and 100309 transitions. [2019-09-08 13:42:10,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:42:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 60414 states and 100309 transitions. [2019-09-08 13:42:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:42:10,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:10,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:10,656 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:10,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1851405605, now seen corresponding path program 1 times [2019-09-08 13:42:10,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:10,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:10,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:42:11,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:42:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:42:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:42:11,043 INFO L87 Difference]: Start difference. First operand 60414 states and 100309 transitions. Second operand 3 states. [2019-09-08 13:42:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:15,544 INFO L93 Difference]: Finished difference Result 161155 states and 267909 transitions. [2019-09-08 13:42:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:42:15,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-08 13:42:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:15,682 INFO L225 Difference]: With dead ends: 161155 [2019-09-08 13:42:15,682 INFO L226 Difference]: Without dead ends: 102097 [2019-09-08 13:42:15,736 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:42:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102097 states. [2019-09-08 13:42:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102097 to 97879. [2019-09-08 13:42:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97879 states. [2019-09-08 13:42:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97879 states to 97879 states and 161902 transitions. [2019-09-08 13:42:20,726 INFO L78 Accepts]: Start accepts. Automaton has 97879 states and 161902 transitions. Word has length 398 [2019-09-08 13:42:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:20,727 INFO L475 AbstractCegarLoop]: Abstraction has 97879 states and 161902 transitions. [2019-09-08 13:42:20,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:42:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 97879 states and 161902 transitions. [2019-09-08 13:42:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:42:20,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:20,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:20,736 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1041603629, now seen corresponding path program 1 times [2019-09-08 13:42:20,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:20,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:20,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:42:21,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:42:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:42:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:42:21,382 INFO L87 Difference]: Start difference. First operand 97879 states and 161902 transitions. Second operand 4 states. [2019-09-08 13:42:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:30,876 INFO L93 Difference]: Finished difference Result 263129 states and 434359 transitions. [2019-09-08 13:42:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:42:30,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2019-09-08 13:42:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:31,255 INFO L225 Difference]: With dead ends: 263129 [2019-09-08 13:42:31,255 INFO L226 Difference]: Without dead ends: 167386 [2019-09-08 13:42:31,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:42:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167386 states. [2019-09-08 13:42:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167386 to 167382. [2019-09-08 13:42:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167382 states. [2019-09-08 13:42:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167382 states to 167382 states and 274294 transitions. [2019-09-08 13:42:43,235 INFO L78 Accepts]: Start accepts. Automaton has 167382 states and 274294 transitions. Word has length 398 [2019-09-08 13:42:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:43,236 INFO L475 AbstractCegarLoop]: Abstraction has 167382 states and 274294 transitions. [2019-09-08 13:42:43,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:42:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 167382 states and 274294 transitions. [2019-09-08 13:42:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:42:43,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:43,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:43,244 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1545084735, now seen corresponding path program 1 times [2019-09-08 13:42:43,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:43,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:43,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:43,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:42:43,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:42:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:42:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:42:43,938 INFO L87 Difference]: Start difference. First operand 167382 states and 274294 transitions. Second operand 5 states. [2019-09-08 13:42:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:59,137 INFO L93 Difference]: Finished difference Result 366666 states and 600392 transitions. [2019-09-08 13:42:59,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:42:59,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 398 [2019-09-08 13:42:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:59,453 INFO L225 Difference]: With dead ends: 366666 [2019-09-08 13:42:59,454 INFO L226 Difference]: Without dead ends: 205138 [2019-09-08 13:42:59,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:42:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205138 states. [2019-09-08 13:43:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205138 to 169016. [2019-09-08 13:43:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169016 states. [2019-09-08 13:43:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169016 states to 169016 states and 276854 transitions. [2019-09-08 13:43:08,525 INFO L78 Accepts]: Start accepts. Automaton has 169016 states and 276854 transitions. Word has length 398 [2019-09-08 13:43:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:43:08,526 INFO L475 AbstractCegarLoop]: Abstraction has 169016 states and 276854 transitions. [2019-09-08 13:43:08,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:43:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 169016 states and 276854 transitions. [2019-09-08 13:43:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:43:08,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:43:08,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:43:08,541 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:43:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:43:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1032697416, now seen corresponding path program 1 times [2019-09-08 13:43:08,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:43:08,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:43:08,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:08,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:43:08,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:43:09,045 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:43:09,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:43:09,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:43:09,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:43:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:43:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:43:09,047 INFO L87 Difference]: Start difference. First operand 169016 states and 276854 transitions. Second operand 6 states. [2019-09-08 13:43:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:43:26,259 INFO L93 Difference]: Finished difference Result 446236 states and 731841 transitions. [2019-09-08 13:43:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:43:26,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 398 [2019-09-08 13:43:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:43:26,785 INFO L225 Difference]: With dead ends: 446236 [2019-09-08 13:43:26,785 INFO L226 Difference]: Without dead ends: 298388 [2019-09-08 13:43:26,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:43:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298388 states. [2019-09-08 13:43:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298388 to 289418. [2019-09-08 13:43:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289418 states. [2019-09-08 13:43:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289418 states to 289418 states and 474488 transitions. [2019-09-08 13:43:49,660 INFO L78 Accepts]: Start accepts. Automaton has 289418 states and 474488 transitions. Word has length 398 [2019-09-08 13:43:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:43:49,660 INFO L475 AbstractCegarLoop]: Abstraction has 289418 states and 474488 transitions. [2019-09-08 13:43:49,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:43:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 289418 states and 474488 transitions. [2019-09-08 13:43:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 13:43:49,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:43:49,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:43:49,672 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:43:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:43:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash 116052973, now seen corresponding path program 1 times [2019-09-08 13:43:49,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:43:49,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:43:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:49,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:43:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:43:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:43:50,557 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:43:50,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:43:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:43:50,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:43:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:43:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:43:50,559 INFO L87 Difference]: Start difference. First operand 289418 states and 474488 transitions. Second operand 3 states. [2019-09-08 13:44:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:44:09,683 INFO L93 Difference]: Finished difference Result 572502 states and 938922 transitions. [2019-09-08 13:44:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:44:09,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-08 13:44:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:44:10,216 INFO L225 Difference]: With dead ends: 572502 [2019-09-08 13:44:10,217 INFO L226 Difference]: Without dead ends: 287036 [2019-09-08 13:44:10,453 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:44:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287036 states. [2019-09-08 13:44:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287036 to 287034. [2019-09-08 13:44:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287034 states. [2019-09-08 13:44:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287034 states to 287034 states and 469573 transitions. [2019-09-08 13:44:33,435 INFO L78 Accepts]: Start accepts. Automaton has 287034 states and 469573 transitions. Word has length 398 [2019-09-08 13:44:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:44:33,435 INFO L475 AbstractCegarLoop]: Abstraction has 287034 states and 469573 transitions. [2019-09-08 13:44:33,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:44:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 287034 states and 469573 transitions. [2019-09-08 13:44:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 13:44:33,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:44:33,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:44:33,443 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:44:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:44:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 141759601, now seen corresponding path program 1 times [2019-09-08 13:44:33,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:44:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:44:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:44:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:44:34,397 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:44:34,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:44:34,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:44:34,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:44:34,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:44:34,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:44:34,400 INFO L87 Difference]: Start difference. First operand 287034 states and 469573 transitions. Second operand 3 states. [2019-09-08 13:45:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:45:02,764 INFO L93 Difference]: Finished difference Result 660734 states and 1081545 transitions. [2019-09-08 13:45:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:45:02,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-08 13:45:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:45:03,525 INFO L225 Difference]: With dead ends: 660734 [2019-09-08 13:45:03,525 INFO L226 Difference]: Without dead ends: 490607 [2019-09-08 13:45:03,713 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:45:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490607 states. [2019-09-08 13:45:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490607 to 446067. [2019-09-08 13:45:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446067 states. [2019-09-08 13:45:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446067 states to 446067 states and 725840 transitions. [2019-09-08 13:45:38,465 INFO L78 Accepts]: Start accepts. Automaton has 446067 states and 725840 transitions. Word has length 399 [2019-09-08 13:45:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:45:38,466 INFO L475 AbstractCegarLoop]: Abstraction has 446067 states and 725840 transitions. [2019-09-08 13:45:38,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:45:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 446067 states and 725840 transitions. [2019-09-08 13:45:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 13:45:38,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:45:38,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:45:38,478 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:45:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:45:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2083811022, now seen corresponding path program 1 times [2019-09-08 13:45:38,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:45:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:45:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:45:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:45:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:45:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:45:38,746 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:45:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:45:38,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:45:38,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:45:38,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:45:38,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:45:38,748 INFO L87 Difference]: Start difference. First operand 446067 states and 725840 transitions. Second operand 3 states. [2019-09-08 13:46:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:46:10,279 INFO L93 Difference]: Finished difference Result 786135 states and 1281024 transitions. [2019-09-08 13:46:10,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:46:10,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-08 13:46:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:46:11,087 INFO L225 Difference]: With dead ends: 786135 [2019-09-08 13:46:11,087 INFO L226 Difference]: Without dead ends: 444373 [2019-09-08 13:46:11,414 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:46:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444373 states. [2019-09-08 13:46:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444373 to 444371. [2019-09-08 13:46:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444371 states. [2019-09-08 13:46:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444371 states to 444371 states and 723212 transitions. [2019-09-08 13:46:46,246 INFO L78 Accepts]: Start accepts. Automaton has 444371 states and 723212 transitions. Word has length 399 [2019-09-08 13:46:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:46:46,246 INFO L475 AbstractCegarLoop]: Abstraction has 444371 states and 723212 transitions. [2019-09-08 13:46:46,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:46:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 444371 states and 723212 transitions. [2019-09-08 13:46:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 13:46:46,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:46:46,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:46:46,254 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:46:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:46:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash 518999334, now seen corresponding path program 1 times [2019-09-08 13:46:46,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:46:46,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:46:46,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:46:46,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:46:46,844 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:46:46,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:46:46,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:46:46,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:46:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:46:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:46:46,846 INFO L87 Difference]: Start difference. First operand 444371 states and 723212 transitions. Second operand 6 states. [2019-09-08 13:47:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:47:21,696 INFO L93 Difference]: Finished difference Result 694617 states and 1131998 transitions. [2019-09-08 13:47:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:47:21,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-08 13:47:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:47:22,525 INFO L225 Difference]: With dead ends: 694617 [2019-09-08 13:47:22,525 INFO L226 Difference]: Without dead ends: 513865 [2019-09-08 13:47:22,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:47:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513865 states. [2019-09-08 13:47:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513865 to 505275. [2019-09-08 13:47:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505275 states. [2019-09-08 13:48:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505275 states to 505275 states and 822782 transitions. [2019-09-08 13:48:00,811 INFO L78 Accepts]: Start accepts. Automaton has 505275 states and 822782 transitions. Word has length 403 [2019-09-08 13:48:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:48:00,812 INFO L475 AbstractCegarLoop]: Abstraction has 505275 states and 822782 transitions. [2019-09-08 13:48:00,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:48:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 505275 states and 822782 transitions. [2019-09-08 13:48:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 13:48:00,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:48:00,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:48:00,823 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:48:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:48:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1132730971, now seen corresponding path program 1 times [2019-09-08 13:48:00,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:48:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:48:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:48:00,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:48:00,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:48:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:48:01,847 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:48:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:48:01,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:48:01,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:48:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:48:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:48:01,848 INFO L87 Difference]: Start difference. First operand 505275 states and 822782 transitions. Second operand 8 states. [2019-09-08 13:49:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:49:51,720 INFO L93 Difference]: Finished difference Result 1956859 states and 3170246 transitions. [2019-09-08 13:49:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:49:51,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 404 [2019-09-08 13:49:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:49:55,305 INFO L225 Difference]: With dead ends: 1956859 [2019-09-08 13:49:55,305 INFO L226 Difference]: Without dead ends: 1456798 [2019-09-08 13:49:55,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:49:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456798 states.