java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:04:42,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:04:42,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:04:42,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:04:42,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:04:42,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:04:42,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:04:42,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:04:42,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:04:42,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:04:42,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:04:42,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:04:42,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:04:42,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:04:42,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:04:42,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:04:42,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:04:42,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:04:42,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:04:42,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:04:42,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:04:42,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:04:42,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:04:42,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:04:42,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:04:42,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:04:42,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:04:42,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:04:42,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:04:42,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:04:42,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:04:42,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:04:42,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:04:42,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:04:42,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:04:42,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:04:42,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:04:42,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:04:42,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:04:42,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:04:42,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:04:42,387 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 10:04:42,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:04:42,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:04:42,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:04:42,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:04:42,420 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:04:42,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:04:42,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:04:42,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:04:42,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:04:42,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:04:42,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:04:42,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:04:42,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:04:42,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:04:42,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:04:42,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:04:42,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:04:42,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:04:42,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:04:42,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:04:42,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:04:42,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:04:42,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:04:42,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:04:42,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:04:42,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:04:42,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:04:42,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:04:42,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:04:42,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:04:42,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:04:42,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:04:42,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:04:42,505 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:04:42,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:04:42,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb28d797/884452f292514fd5ac807caf2a74b330/FLAGe2e8189a0 [2019-09-08 10:04:43,230 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:04:43,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:04:43,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb28d797/884452f292514fd5ac807caf2a74b330/FLAGe2e8189a0 [2019-09-08 10:04:43,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb28d797/884452f292514fd5ac807caf2a74b330 [2019-09-08 10:04:43,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:04:43,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:04:43,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:04:43,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:04:43,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:04:43,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:04:43" (1/1) ... [2019-09-08 10:04:43,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:43, skipping insertion in model container [2019-09-08 10:04:43,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:04:43" (1/1) ... [2019-09-08 10:04:43,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:04:43,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:04:44,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:04:44,268 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:04:44,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:04:44,738 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:04:44,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44 WrapperNode [2019-09-08 10:04:44,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:04:44,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:04:44,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:04:44,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:04:44,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (1/1) ... [2019-09-08 10:04:44,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:04:44,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:04:44,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:04:44,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:04:44,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (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 10:04:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:04:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:04:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:04:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:04:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:04:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:04:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:04:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:04:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:04:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:04:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:04:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:04:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:04:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:04:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:04:45,046 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:04:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:04:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:04:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:04:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:04:47,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:04:47,434 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:04:47,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:04:47 BoogieIcfgContainer [2019-09-08 10:04:47,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:04:47,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:04:47,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:04:47,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:04:47,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:04:43" (1/3) ... [2019-09-08 10:04:47,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db73402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:04:47, skipping insertion in model container [2019-09-08 10:04:47,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:04:44" (2/3) ... [2019-09-08 10:04:47,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db73402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:04:47, skipping insertion in model container [2019-09-08 10:04:47,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:04:47" (3/3) ... [2019-09-08 10:04:47,444 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:04:47,454 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:04:47,464 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:04:47,481 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:04:47,518 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:04:47,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:04:47,519 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:04:47,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:04:47,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:04:47,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:04:47,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:04:47,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:04:47,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:04:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-09-08 10:04:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 10:04:47,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:47,577 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] [2019-09-08 10:04:47,579 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1863658618, now seen corresponding path program 1 times [2019-09-08 10:04:47,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:47,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:47,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:48,440 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 10:04:48,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:48,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:48,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:48,469 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 3 states. [2019-09-08 10:04:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:48,684 INFO L93 Difference]: Finished difference Result 1096 states and 1950 transitions. [2019-09-08 10:04:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:48,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-08 10:04:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:48,718 INFO L225 Difference]: With dead ends: 1096 [2019-09-08 10:04:48,718 INFO L226 Difference]: Without dead ends: 894 [2019-09-08 10:04:48,726 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 10:04:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-08 10:04:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 892. [2019-09-08 10:04:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-08 10:04:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1564 transitions. [2019-09-08 10:04:48,871 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1564 transitions. Word has length 188 [2019-09-08 10:04:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:48,875 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1564 transitions. [2019-09-08 10:04:48,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1564 transitions. [2019-09-08 10:04:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 10:04:48,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:48,886 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] [2019-09-08 10:04:48,887 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -229379037, now seen corresponding path program 1 times [2019-09-08 10:04:48,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:49,189 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 10:04:49,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:49,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:49,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:49,194 INFO L87 Difference]: Start difference. First operand 892 states and 1564 transitions. Second operand 3 states. [2019-09-08 10:04:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:49,274 INFO L93 Difference]: Finished difference Result 1600 states and 2756 transitions. [2019-09-08 10:04:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:49,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 10:04:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:49,285 INFO L225 Difference]: With dead ends: 1600 [2019-09-08 10:04:49,285 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 10:04:49,292 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 10:04:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 10:04:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1233. [2019-09-08 10:04:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-09-08 10:04:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2136 transitions. [2019-09-08 10:04:49,411 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2136 transitions. Word has length 192 [2019-09-08 10:04:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:49,412 INFO L475 AbstractCegarLoop]: Abstraction has 1233 states and 2136 transitions. [2019-09-08 10:04:49,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2136 transitions. [2019-09-08 10:04:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 10:04:49,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:49,417 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] [2019-09-08 10:04:49,417 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1188495585, now seen corresponding path program 1 times [2019-09-08 10:04:49,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:49,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:49,611 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 10:04:49,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:49,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:49,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:49,613 INFO L87 Difference]: Start difference. First operand 1233 states and 2136 transitions. Second operand 3 states. [2019-09-08 10:04:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:49,688 INFO L93 Difference]: Finished difference Result 1934 states and 3320 transitions. [2019-09-08 10:04:49,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:49,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 10:04:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:49,699 INFO L225 Difference]: With dead ends: 1934 [2019-09-08 10:04:49,699 INFO L226 Difference]: Without dead ends: 1569 [2019-09-08 10:04:49,701 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 10:04:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2019-09-08 10:04:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1567. [2019-09-08 10:04:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-09-08 10:04:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2698 transitions. [2019-09-08 10:04:49,753 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2698 transitions. Word has length 196 [2019-09-08 10:04:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:49,754 INFO L475 AbstractCegarLoop]: Abstraction has 1567 states and 2698 transitions. [2019-09-08 10:04:49,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2698 transitions. [2019-09-08 10:04:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 10:04:49,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:49,759 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] [2019-09-08 10:04:49,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1919463846, now seen corresponding path program 1 times [2019-09-08 10:04:49,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:49,960 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 10:04:49,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:49,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:49,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:49,963 INFO L87 Difference]: Start difference. First operand 1567 states and 2698 transitions. Second operand 3 states. [2019-09-08 10:04:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:50,160 INFO L93 Difference]: Finished difference Result 3507 states and 5954 transitions. [2019-09-08 10:04:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:50,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 10:04:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:50,180 INFO L225 Difference]: With dead ends: 3507 [2019-09-08 10:04:50,180 INFO L226 Difference]: Without dead ends: 2504 [2019-09-08 10:04:50,184 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 10:04:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-09-08 10:04:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2502. [2019-09-08 10:04:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2019-09-08 10:04:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 4256 transitions. [2019-09-08 10:04:50,290 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 4256 transitions. Word has length 196 [2019-09-08 10:04:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:50,291 INFO L475 AbstractCegarLoop]: Abstraction has 2502 states and 4256 transitions. [2019-09-08 10:04:50,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 4256 transitions. [2019-09-08 10:04:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 10:04:50,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:50,296 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] [2019-09-08 10:04:50,297 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash 357755907, now seen corresponding path program 1 times [2019-09-08 10:04:50,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:50,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:50,499 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 10:04:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:50,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:50,501 INFO L87 Difference]: Start difference. First operand 2502 states and 4256 transitions. Second operand 3 states. [2019-09-08 10:04:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:50,679 INFO L93 Difference]: Finished difference Result 6246 states and 10502 transitions. [2019-09-08 10:04:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:50,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-08 10:04:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:50,702 INFO L225 Difference]: With dead ends: 6246 [2019-09-08 10:04:50,703 INFO L226 Difference]: Without dead ends: 4308 [2019-09-08 10:04:50,708 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 10:04:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2019-09-08 10:04:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 4306. [2019-09-08 10:04:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4306 states. [2019-09-08 10:04:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 7240 transitions. [2019-09-08 10:04:50,933 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 7240 transitions. Word has length 200 [2019-09-08 10:04:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:50,934 INFO L475 AbstractCegarLoop]: Abstraction has 4306 states and 7240 transitions. [2019-09-08 10:04:50,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 7240 transitions. [2019-09-08 10:04:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 10:04:50,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:50,939 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] [2019-09-08 10:04:50,940 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 184693649, now seen corresponding path program 1 times [2019-09-08 10:04:50,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:50,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:51,119 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 10:04:51,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:51,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:51,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:51,121 INFO L87 Difference]: Start difference. First operand 4306 states and 7240 transitions. Second operand 3 states. [2019-09-08 10:04:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:51,343 INFO L93 Difference]: Finished difference Result 7902 states and 13256 transitions. [2019-09-08 10:04:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:51,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 10:04:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:51,380 INFO L225 Difference]: With dead ends: 7902 [2019-09-08 10:04:51,381 INFO L226 Difference]: Without dead ends: 5964 [2019-09-08 10:04:51,389 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 10:04:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-09-08 10:04:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5962. [2019-09-08 10:04:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5962 states. [2019-09-08 10:04:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 9990 transitions. [2019-09-08 10:04:51,831 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 9990 transitions. Word has length 204 [2019-09-08 10:04:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:51,832 INFO L475 AbstractCegarLoop]: Abstraction has 5962 states and 9990 transitions. [2019-09-08 10:04:51,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 9990 transitions. [2019-09-08 10:04:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 10:04:51,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:51,839 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] [2019-09-08 10:04:51,839 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 435283910, now seen corresponding path program 1 times [2019-09-08 10:04:51,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:52,070 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 10:04:52,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:52,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:52,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:52,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:52,073 INFO L87 Difference]: Start difference. First operand 5962 states and 9990 transitions. Second operand 3 states. [2019-09-08 10:04:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:52,480 INFO L93 Difference]: Finished difference Result 16130 states and 26828 transitions. [2019-09-08 10:04:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:52,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 10:04:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:52,538 INFO L225 Difference]: With dead ends: 16130 [2019-09-08 10:04:52,539 INFO L226 Difference]: Without dead ends: 10848 [2019-09-08 10:04:52,556 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 10:04:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10848 states. [2019-09-08 10:04:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10848 to 10846. [2019-09-08 10:04:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10846 states. [2019-09-08 10:04:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 17994 transitions. [2019-09-08 10:04:53,205 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 17994 transitions. Word has length 204 [2019-09-08 10:04:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:53,206 INFO L475 AbstractCegarLoop]: Abstraction has 10846 states and 17994 transitions. [2019-09-08 10:04:53,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 17994 transitions. [2019-09-08 10:04:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 10:04:53,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:53,210 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] [2019-09-08 10:04:53,210 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 696486883, now seen corresponding path program 1 times [2019-09-08 10:04:53,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:53,687 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 10:04:53,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:53,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:04:53,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:04:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:04:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:04:53,689 INFO L87 Difference]: Start difference. First operand 10846 states and 17994 transitions. Second operand 7 states. [2019-09-08 10:04:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:58,022 INFO L93 Difference]: Finished difference Result 72117 states and 119927 transitions. [2019-09-08 10:04:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:04:58,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-09-08 10:04:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:58,211 INFO L225 Difference]: With dead ends: 72117 [2019-09-08 10:04:58,211 INFO L226 Difference]: Without dead ends: 61951 [2019-09-08 10:04:58,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:04:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61951 states. [2019-09-08 10:04:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61951 to 20941. [2019-09-08 10:04:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20941 states. [2019-09-08 10:04:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20941 states to 20941 states and 34578 transitions. [2019-09-08 10:04:59,961 INFO L78 Accepts]: Start accepts. Automaton has 20941 states and 34578 transitions. Word has length 208 [2019-09-08 10:04:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:59,961 INFO L475 AbstractCegarLoop]: Abstraction has 20941 states and 34578 transitions. [2019-09-08 10:04:59,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:04:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20941 states and 34578 transitions. [2019-09-08 10:04:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 10:04:59,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:59,967 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] [2019-09-08 10:04:59,968 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:59,968 INFO L82 PathProgramCache]: Analyzing trace with hash 45530812, now seen corresponding path program 1 times [2019-09-08 10:04:59,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:59,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:59,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:00,158 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 10:05:00,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:00,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:05:00,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:05:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:05:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:05:00,160 INFO L87 Difference]: Start difference. First operand 20941 states and 34578 transitions. Second operand 4 states. [2019-09-08 10:05:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:02,561 INFO L93 Difference]: Finished difference Result 56868 states and 94245 transitions. [2019-09-08 10:05:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:02,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-09-08 10:05:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:02,680 INFO L225 Difference]: With dead ends: 56868 [2019-09-08 10:05:02,681 INFO L226 Difference]: Without dead ends: 36669 [2019-09-08 10:05:02,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-09-08 10:05:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 31420. [2019-09-08 10:05:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31420 states. [2019-09-08 10:05:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31420 states to 31420 states and 51964 transitions. [2019-09-08 10:05:04,604 INFO L78 Accepts]: Start accepts. Automaton has 31420 states and 51964 transitions. Word has length 209 [2019-09-08 10:05:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:04,605 INFO L475 AbstractCegarLoop]: Abstraction has 31420 states and 51964 transitions. [2019-09-08 10:05:04,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:05:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31420 states and 51964 transitions. [2019-09-08 10:05:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 10:05:04,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:04,611 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] [2019-09-08 10:05:04,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1124343866, now seen corresponding path program 1 times [2019-09-08 10:05:04,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:04,771 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 10:05:04,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:04,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:04,773 INFO L87 Difference]: Start difference. First operand 31420 states and 51964 transitions. Second operand 3 states. [2019-09-08 10:05:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:06,316 INFO L93 Difference]: Finished difference Result 60166 states and 99666 transitions. [2019-09-08 10:05:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:06,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 10:05:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:06,431 INFO L225 Difference]: With dead ends: 60166 [2019-09-08 10:05:06,431 INFO L226 Difference]: Without dead ends: 44126 [2019-09-08 10:05:06,475 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 10:05:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44126 states. [2019-09-08 10:05:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44126 to 44124. [2019-09-08 10:05:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44124 states. [2019-09-08 10:05:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44124 states to 44124 states and 72852 transitions. [2019-09-08 10:05:09,265 INFO L78 Accepts]: Start accepts. Automaton has 44124 states and 72852 transitions. Word has length 209 [2019-09-08 10:05:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:09,266 INFO L475 AbstractCegarLoop]: Abstraction has 44124 states and 72852 transitions. [2019-09-08 10:05:09,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 44124 states and 72852 transitions. [2019-09-08 10:05:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 10:05:09,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:09,272 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] [2019-09-08 10:05:09,272 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1021288442, now seen corresponding path program 1 times [2019-09-08 10:05:09,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:05:09,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:09,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:09,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:09,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:09,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:09,421 INFO L87 Difference]: Start difference. First operand 44124 states and 72852 transitions. Second operand 3 states. [2019-09-08 10:05:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:11,710 INFO L93 Difference]: Finished difference Result 83926 states and 138896 transitions. [2019-09-08 10:05:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:11,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 10:05:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:11,796 INFO L225 Difference]: With dead ends: 83926 [2019-09-08 10:05:11,796 INFO L226 Difference]: Without dead ends: 61162 [2019-09-08 10:05:11,839 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 10:05:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61162 states. [2019-09-08 10:05:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61162 to 61160. [2019-09-08 10:05:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61160 states. [2019-09-08 10:05:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61160 states to 61160 states and 100869 transitions. [2019-09-08 10:05:15,563 INFO L78 Accepts]: Start accepts. Automaton has 61160 states and 100869 transitions. Word has length 209 [2019-09-08 10:05:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:15,564 INFO L475 AbstractCegarLoop]: Abstraction has 61160 states and 100869 transitions. [2019-09-08 10:05:15,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 61160 states and 100869 transitions. [2019-09-08 10:05:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 10:05:15,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:15,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:05:15,569 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash 15921222, now seen corresponding path program 1 times [2019-09-08 10:05:15,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:15,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:15,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:15,729 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 10:05:15,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:15,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:15,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:15,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:15,731 INFO L87 Difference]: Start difference. First operand 61160 states and 100869 transitions. Second operand 3 states. [2019-09-08 10:05:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:19,316 INFO L93 Difference]: Finished difference Result 133864 states and 222069 transitions. [2019-09-08 10:05:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:19,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 10:05:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:19,463 INFO L225 Difference]: With dead ends: 133864 [2019-09-08 10:05:19,463 INFO L226 Difference]: Without dead ends: 92040 [2019-09-08 10:05:19,529 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 10:05:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92040 states. [2019-09-08 10:05:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92040 to 92038. [2019-09-08 10:05:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92038 states. [2019-09-08 10:05:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92038 states to 92038 states and 151920 transitions. [2019-09-08 10:05:25,050 INFO L78 Accepts]: Start accepts. Automaton has 92038 states and 151920 transitions. Word has length 209 [2019-09-08 10:05:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:25,051 INFO L475 AbstractCegarLoop]: Abstraction has 92038 states and 151920 transitions. [2019-09-08 10:05:25,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92038 states and 151920 transitions. [2019-09-08 10:05:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 10:05:25,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:25,053 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] [2019-09-08 10:05:25,053 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1345287114, now seen corresponding path program 1 times [2019-09-08 10:05:25,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:25,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:25,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:25,239 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 10:05:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:25,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:05:25,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:05:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:05:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:05:25,241 INFO L87 Difference]: Start difference. First operand 92038 states and 151920 transitions. Second operand 4 states. [2019-09-08 10:05:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:35,217 INFO L93 Difference]: Finished difference Result 272300 states and 450310 transitions. [2019-09-08 10:05:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:35,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 10:05:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:35,511 INFO L225 Difference]: With dead ends: 272300 [2019-09-08 10:05:35,511 INFO L226 Difference]: Without dead ends: 180883 [2019-09-08 10:05:35,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180883 states. [2019-09-08 10:05:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180883 to 151244. [2019-09-08 10:05:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151244 states. [2019-09-08 10:05:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151244 states to 151244 states and 249190 transitions. [2019-09-08 10:05:42,290 INFO L78 Accepts]: Start accepts. Automaton has 151244 states and 249190 transitions. Word has length 210 [2019-09-08 10:05:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:42,290 INFO L475 AbstractCegarLoop]: Abstraction has 151244 states and 249190 transitions. [2019-09-08 10:05:42,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:05:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 151244 states and 249190 transitions. [2019-09-08 10:05:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 10:05:42,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:42,293 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] [2019-09-08 10:05:42,293 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1307382461, now seen corresponding path program 1 times [2019-09-08 10:05:42,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:42,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:42,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:42,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:42,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:42,466 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 10:05:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:42,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:05:42,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:05:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:05:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:05:42,468 INFO L87 Difference]: Start difference. First operand 151244 states and 249190 transitions. Second operand 4 states. [2019-09-08 10:05:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:57,332 INFO L93 Difference]: Finished difference Result 446858 states and 737752 transitions. [2019-09-08 10:05:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:57,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-09-08 10:05:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:57,796 INFO L225 Difference]: With dead ends: 446858 [2019-09-08 10:05:57,797 INFO L226 Difference]: Without dead ends: 296235 [2019-09-08 10:05:57,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296235 states. [2019-09-08 10:06:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296235 to 248174. [2019-09-08 10:06:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248174 states. [2019-09-08 10:06:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248174 states to 248174 states and 408172 transitions. [2019-09-08 10:06:18,903 INFO L78 Accepts]: Start accepts. Automaton has 248174 states and 408172 transitions. Word has length 211 [2019-09-08 10:06:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:18,903 INFO L475 AbstractCegarLoop]: Abstraction has 248174 states and 408172 transitions. [2019-09-08 10:06:18,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:06:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 248174 states and 408172 transitions. [2019-09-08 10:06:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 10:06:18,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:18,905 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] [2019-09-08 10:06:18,905 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1931202639, now seen corresponding path program 1 times [2019-09-08 10:06:18,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:18,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:19,132 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 10:06:19,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:19,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:06:19,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:06:19,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:06:19,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:06:19,133 INFO L87 Difference]: Start difference. First operand 248174 states and 408172 transitions. Second operand 4 states. [2019-09-08 10:06:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:48,685 INFO L93 Difference]: Finished difference Result 736205 states and 1213297 transitions. [2019-09-08 10:06:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:06:48,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-08 10:06:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:49,624 INFO L225 Difference]: With dead ends: 736205 [2019-09-08 10:06:49,624 INFO L226 Difference]: Without dead ends: 488652 [2019-09-08 10:06:49,911 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 10:06:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488652 states. [2019-09-08 10:07:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488652 to 405700. [2019-09-08 10:07:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405700 states. [2019-09-08 10:07:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405700 states to 405700 states and 666122 transitions. [2019-09-08 10:07:25,807 INFO L78 Accepts]: Start accepts. Automaton has 405700 states and 666122 transitions. Word has length 212 [2019-09-08 10:07:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:25,807 INFO L475 AbstractCegarLoop]: Abstraction has 405700 states and 666122 transitions. [2019-09-08 10:07:25,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 405700 states and 666122 transitions. [2019-09-08 10:07:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 10:07:25,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:25,809 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] [2019-09-08 10:07:25,809 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 209766346, now seen corresponding path program 1 times [2019-09-08 10:07:25,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:26,066 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 10:07:26,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:26,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:07:26,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:07:26,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:07:26,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:07:26,068 INFO L87 Difference]: Start difference. First operand 405700 states and 666122 transitions. Second operand 8 states. [2019-09-08 10:09:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:53,927 INFO L93 Difference]: Finished difference Result 2237206 states and 3686599 transitions. [2019-09-08 10:09:53,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:09:53,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-08 10:09:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:57,074 INFO L225 Difference]: With dead ends: 2237206 [2019-09-08 10:09:57,074 INFO L226 Difference]: Without dead ends: 1832127 [2019-09-08 10:09:57,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:09:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832127 states. [2019-09-08 10:12:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832127 to 1110402. [2019-09-08 10:12:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110402 states. [2019-09-08 10:12:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110402 states to 1110402 states and 1815816 transitions. [2019-09-08 10:12:28,648 INFO L78 Accepts]: Start accepts. Automaton has 1110402 states and 1815816 transitions. Word has length 213 [2019-09-08 10:12:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:28,649 INFO L475 AbstractCegarLoop]: Abstraction has 1110402 states and 1815816 transitions. [2019-09-08 10:12:28,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:12:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1110402 states and 1815816 transitions. [2019-09-08 10:12:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 10:12:28,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:28,651 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] [2019-09-08 10:12:28,651 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1767626310, now seen corresponding path program 1 times [2019-09-08 10:12:28,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:28,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:29,138 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 10:12:29,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:29,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:12:29,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:12:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:12:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:12:29,139 INFO L87 Difference]: Start difference. First operand 1110402 states and 1815816 transitions. Second operand 7 states.