java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:29:03,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:29:03,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:29:03,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:29:03,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:29:03,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:29:03,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:29:03,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:29:03,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:29:03,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:29:03,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:29:03,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:29:03,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:29:03,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:29:03,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:29:03,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:29:03,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:29:03,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:29:03,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:29:03,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:29:03,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:29:03,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:29:03,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:29:03,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:29:03,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:29:03,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:29:03,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:29:03,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:29:03,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:29:03,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:29:03,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:29:03,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:29:03,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:29:03,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:29:03,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:29:03,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:29:03,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:29:03,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:29:03,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:29:03,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:29:03,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:29:03,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:29:03,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:29:03,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:29:03,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:29:03,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:29:03,368 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:29:03,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:29:03,368 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:29:03,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:29:03,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:29:03,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:29:03,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:29:03,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:29:03,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:29:03,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:29:03,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:29:03,370 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:29:03,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:29:03,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:29:03,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:29:03,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:29:03,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:29:03,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:03,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:29:03,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:29:03,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:29:03,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:29:03,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:29:03,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:29:03,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:29:03,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:29:03,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:29:03,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:29:03,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:29:03,419 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:29:03,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:29:03,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9834730e/81cb6dedebe64ce7b82a614b7d3ff5af/FLAG4d4373125 [2019-09-08 13:29:04,143 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:29:04,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:29:04,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9834730e/81cb6dedebe64ce7b82a614b7d3ff5af/FLAG4d4373125 [2019-09-08 13:29:04,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9834730e/81cb6dedebe64ce7b82a614b7d3ff5af [2019-09-08 13:29:04,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:29:04,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:29:04,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:04,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:29:04,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:29:04,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:04" (1/1) ... [2019-09-08 13:29:04,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffb548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:04, skipping insertion in model container [2019-09-08 13:29:04,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:04" (1/1) ... [2019-09-08 13:29:04,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:29:04,437 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:29:05,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:05,504 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:29:05,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:06,017 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:29:06,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06 WrapperNode [2019-09-08 13:29:06,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:06,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:29:06,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:29:06,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:29:06,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... [2019-09-08 13:29:06,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:29:06,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:29:06,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:29:06,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:29:06,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:29:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:29:06,367 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:29:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:29:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:29:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:29:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:29:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:29:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:29:06,370 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:29:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:29:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:29:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:29:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:29:06,373 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:29:06,374 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:29:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:29:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:29:06,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:29:09,035 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:29:09,036 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:29:09,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:09 BoogieIcfgContainer [2019-09-08 13:29:09,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:29:09,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:29:09,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:29:09,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:29:09,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:29:04" (1/3) ... [2019-09-08 13:29:09,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d287669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:09, skipping insertion in model container [2019-09-08 13:29:09,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:06" (2/3) ... [2019-09-08 13:29:09,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d287669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:29:09, skipping insertion in model container [2019-09-08 13:29:09,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:29:09" (3/3) ... [2019-09-08 13:29:09,045 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:29:09,055 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:29:09,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:29:09,080 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:29:09,119 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:29:09,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:29:09,120 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:29:09,121 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:29:09,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:29:09,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:29:09,121 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:29:09,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:29:09,121 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:29:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states. [2019-09-08 13:29:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:29:09,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:09,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:09,189 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 143397951, now seen corresponding path program 1 times [2019-09-08 13:29:09,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:09,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:10,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:10,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:10,284 INFO L87 Difference]: Start difference. First operand 795 states. Second operand 3 states. [2019-09-08 13:29:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:10,688 INFO L93 Difference]: Finished difference Result 1490 states and 2621 transitions. [2019-09-08 13:29:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:10,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:29:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:10,729 INFO L225 Difference]: With dead ends: 1490 [2019-09-08 13:29:10,730 INFO L226 Difference]: Without dead ends: 1284 [2019-09-08 13:29:10,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-08 13:29:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-09-08 13:29:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-09-08 13:29:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2005 transitions. [2019-09-08 13:29:10,910 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2005 transitions. Word has length 324 [2019-09-08 13:29:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:10,916 INFO L475 AbstractCegarLoop]: Abstraction has 1282 states and 2005 transitions. [2019-09-08 13:29:10,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2005 transitions. [2019-09-08 13:29:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:29:10,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:10,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:10,970 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1854541179, now seen corresponding path program 1 times [2019-09-08 13:29:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:10,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:10,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:10,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:11,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:11,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:11,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:11,397 INFO L87 Difference]: Start difference. First operand 1282 states and 2005 transitions. Second operand 3 states. [2019-09-08 13:29:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:11,727 INFO L93 Difference]: Finished difference Result 2612 states and 4118 transitions. [2019-09-08 13:29:11,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:11,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:29:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:11,748 INFO L225 Difference]: With dead ends: 2612 [2019-09-08 13:29:11,748 INFO L226 Difference]: Without dead ends: 2248 [2019-09-08 13:29:11,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-08 13:29:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-08 13:29:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-08 13:29:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3507 transitions. [2019-09-08 13:29:11,918 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3507 transitions. Word has length 324 [2019-09-08 13:29:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:11,919 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3507 transitions. [2019-09-08 13:29:11,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3507 transitions. [2019-09-08 13:29:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:29:11,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:11,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:11,930 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1626065980, now seen corresponding path program 1 times [2019-09-08 13:29:11,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:11,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:11,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:11,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:12,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:12,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:12,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:12,324 INFO L87 Difference]: Start difference. First operand 2246 states and 3507 transitions. Second operand 3 states. [2019-09-08 13:29:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:12,604 INFO L93 Difference]: Finished difference Result 4822 states and 7593 transitions. [2019-09-08 13:29:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:12,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:29:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:12,626 INFO L225 Difference]: With dead ends: 4822 [2019-09-08 13:29:12,627 INFO L226 Difference]: Without dead ends: 4140 [2019-09-08 13:29:12,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2019-09-08 13:29:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4138. [2019-09-08 13:29:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2019-09-08 13:29:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 6447 transitions. [2019-09-08 13:29:12,824 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 6447 transitions. Word has length 324 [2019-09-08 13:29:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:12,825 INFO L475 AbstractCegarLoop]: Abstraction has 4138 states and 6447 transitions. [2019-09-08 13:29:12,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6447 transitions. [2019-09-08 13:29:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:29:12,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:12,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:12,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -654990492, now seen corresponding path program 1 times [2019-09-08 13:29:12,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:12,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:12,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:13,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:13,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:13,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:13,779 INFO L87 Difference]: Start difference. First operand 4138 states and 6447 transitions. Second operand 4 states. [2019-09-08 13:29:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:14,288 INFO L93 Difference]: Finished difference Result 12231 states and 19038 transitions. [2019-09-08 13:29:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:29:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:14,331 INFO L225 Difference]: With dead ends: 12231 [2019-09-08 13:29:14,332 INFO L226 Difference]: Without dead ends: 8108 [2019-09-08 13:29:14,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2019-09-08 13:29:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 8106. [2019-09-08 13:29:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8106 states. [2019-09-08 13:29:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 12556 transitions. [2019-09-08 13:29:14,727 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 12556 transitions. Word has length 324 [2019-09-08 13:29:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:14,728 INFO L475 AbstractCegarLoop]: Abstraction has 8106 states and 12556 transitions. [2019-09-08 13:29:14,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 12556 transitions. [2019-09-08 13:29:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:29:14,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:14,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:14,747 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:14,748 INFO L82 PathProgramCache]: Analyzing trace with hash -840226377, now seen corresponding path program 1 times [2019-09-08 13:29:14,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:14,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:14,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:14,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:15,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:15,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:15,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:15,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:15,030 INFO L87 Difference]: Start difference. First operand 8106 states and 12556 transitions. Second operand 3 states. [2019-09-08 13:29:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:15,822 INFO L93 Difference]: Finished difference Result 23867 states and 36904 transitions. [2019-09-08 13:29:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:15,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:29:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:15,902 INFO L225 Difference]: With dead ends: 23867 [2019-09-08 13:29:15,903 INFO L226 Difference]: Without dead ends: 15890 [2019-09-08 13:29:15,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15890 states. [2019-09-08 13:29:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15890 to 15888. [2019-09-08 13:29:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15888 states. [2019-09-08 13:29:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 24465 transitions. [2019-09-08 13:29:16,646 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 24465 transitions. Word has length 326 [2019-09-08 13:29:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:16,647 INFO L475 AbstractCegarLoop]: Abstraction has 15888 states and 24465 transitions. [2019-09-08 13:29:16,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 24465 transitions. [2019-09-08 13:29:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:29:16,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:16,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:16,685 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1392604476, now seen corresponding path program 1 times [2019-09-08 13:29:16,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:16,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:16,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:16,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:16,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:16,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:16,945 INFO L87 Difference]: Start difference. First operand 15888 states and 24465 transitions. Second operand 3 states. [2019-09-08 13:29:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:17,834 INFO L93 Difference]: Finished difference Result 47589 states and 73271 transitions. [2019-09-08 13:29:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:17,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:29:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:17,951 INFO L225 Difference]: With dead ends: 47589 [2019-09-08 13:29:17,952 INFO L226 Difference]: Without dead ends: 31743 [2019-09-08 13:29:18,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31743 states. [2019-09-08 13:29:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31743 to 15907. [2019-09-08 13:29:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15907 states. [2019-09-08 13:29:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 24493 transitions. [2019-09-08 13:29:19,760 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 24493 transitions. Word has length 326 [2019-09-08 13:29:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:19,761 INFO L475 AbstractCegarLoop]: Abstraction has 15907 states and 24493 transitions. [2019-09-08 13:29:19,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 24493 transitions. [2019-09-08 13:29:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:29:19,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:19,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:19,798 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash -483333520, now seen corresponding path program 1 times [2019-09-08 13:29:19,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:19,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:19,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:19,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:19,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:19,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:19,991 INFO L87 Difference]: Start difference. First operand 15907 states and 24493 transitions. Second operand 3 states. [2019-09-08 13:29:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:21,175 INFO L93 Difference]: Finished difference Result 47608 states and 73292 transitions. [2019-09-08 13:29:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:21,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:29:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:21,254 INFO L225 Difference]: With dead ends: 47608 [2019-09-08 13:29:21,255 INFO L226 Difference]: Without dead ends: 31761 [2019-09-08 13:29:21,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31761 states. [2019-09-08 13:29:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31761 to 15925. [2019-09-08 13:29:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15925 states. [2019-09-08 13:29:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15925 states to 15925 states and 24514 transitions. [2019-09-08 13:29:22,251 INFO L78 Accepts]: Start accepts. Automaton has 15925 states and 24514 transitions. Word has length 327 [2019-09-08 13:29:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:22,251 INFO L475 AbstractCegarLoop]: Abstraction has 15925 states and 24514 transitions. [2019-09-08 13:29:22,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15925 states and 24514 transitions. [2019-09-08 13:29:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:29:22,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:22,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:22,410 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1336838194, now seen corresponding path program 1 times [2019-09-08 13:29:22,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:22,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:22,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:22,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:22,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:22,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:22,758 INFO L87 Difference]: Start difference. First operand 15925 states and 24514 transitions. Second operand 3 states. [2019-09-08 13:29:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:23,696 INFO L93 Difference]: Finished difference Result 45116 states and 69305 transitions. [2019-09-08 13:29:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:23,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:29:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:23,769 INFO L225 Difference]: With dead ends: 45116 [2019-09-08 13:29:23,770 INFO L226 Difference]: Without dead ends: 29436 [2019-09-08 13:29:23,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29436 states. [2019-09-08 13:29:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29436 to 29434. [2019-09-08 13:29:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29434 states. [2019-09-08 13:29:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29434 states to 29434 states and 44988 transitions. [2019-09-08 13:29:26,134 INFO L78 Accepts]: Start accepts. Automaton has 29434 states and 44988 transitions. Word has length 328 [2019-09-08 13:29:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:26,135 INFO L475 AbstractCegarLoop]: Abstraction has 29434 states and 44988 transitions. [2019-09-08 13:29:26,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29434 states and 44988 transitions. [2019-09-08 13:29:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:29:26,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:26,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:26,194 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1152108785, now seen corresponding path program 1 times [2019-09-08 13:29:26,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:26,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:26,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:26,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:26,560 INFO L87 Difference]: Start difference. First operand 29434 states and 44988 transitions. Second operand 4 states. [2019-09-08 13:29:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:28,340 INFO L93 Difference]: Finished difference Result 85481 states and 130456 transitions. [2019-09-08 13:29:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:28,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:29:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:28,450 INFO L225 Difference]: With dead ends: 85481 [2019-09-08 13:29:28,450 INFO L226 Difference]: Without dead ends: 56587 [2019-09-08 13:29:28,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-08 13:29:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 29669. [2019-09-08 13:29:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29669 states. [2019-09-08 13:29:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29669 states to 29669 states and 45376 transitions. [2019-09-08 13:29:29,910 INFO L78 Accepts]: Start accepts. Automaton has 29669 states and 45376 transitions. Word has length 328 [2019-09-08 13:29:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:29,911 INFO L475 AbstractCegarLoop]: Abstraction has 29669 states and 45376 transitions. [2019-09-08 13:29:29,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29669 states and 45376 transitions. [2019-09-08 13:29:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:29:29,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:29,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:29,944 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash -453644434, now seen corresponding path program 1 times [2019-09-08 13:29:29,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:29,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:31,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:31,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:31,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:31,029 INFO L87 Difference]: Start difference. First operand 29669 states and 45376 transitions. Second operand 3 states. [2019-09-08 13:29:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:32,483 INFO L93 Difference]: Finished difference Result 74993 states and 115452 transitions. [2019-09-08 13:29:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:32,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:29:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:32,717 INFO L225 Difference]: With dead ends: 74993 [2019-09-08 13:29:32,718 INFO L226 Difference]: Without dead ends: 47087 [2019-09-08 13:29:32,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47087 states. [2019-09-08 13:29:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47087 to 37025. [2019-09-08 13:29:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37025 states. [2019-09-08 13:29:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37025 states to 37025 states and 57490 transitions. [2019-09-08 13:29:34,300 INFO L78 Accepts]: Start accepts. Automaton has 37025 states and 57490 transitions. Word has length 330 [2019-09-08 13:29:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:34,301 INFO L475 AbstractCegarLoop]: Abstraction has 37025 states and 57490 transitions. [2019-09-08 13:29:34,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 37025 states and 57490 transitions. [2019-09-08 13:29:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:29:34,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:34,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:34,334 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:34,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1877340163, now seen corresponding path program 1 times [2019-09-08 13:29:34,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:34,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:34,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:34,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:34,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:34,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:34,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:34,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:34,528 INFO L87 Difference]: Start difference. First operand 37025 states and 57490 transitions. Second operand 3 states. [2019-09-08 13:29:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:37,034 INFO L93 Difference]: Finished difference Result 109505 states and 169751 transitions. [2019-09-08 13:29:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:37,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:29:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:37,159 INFO L225 Difference]: With dead ends: 109505 [2019-09-08 13:29:37,160 INFO L226 Difference]: Without dead ends: 73283 [2019-09-08 13:29:37,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73283 states. [2019-09-08 13:29:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73283 to 37129. [2019-09-08 13:29:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37129 states. [2019-09-08 13:29:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37129 states to 37129 states and 57633 transitions. [2019-09-08 13:29:39,016 INFO L78 Accepts]: Start accepts. Automaton has 37129 states and 57633 transitions. Word has length 330 [2019-09-08 13:29:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:39,016 INFO L475 AbstractCegarLoop]: Abstraction has 37129 states and 57633 transitions. [2019-09-08 13:29:39,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37129 states and 57633 transitions. [2019-09-08 13:29:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:29:39,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:39,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:39,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash -804422415, now seen corresponding path program 1 times [2019-09-08 13:29:39,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:39,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:39,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:39,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:40,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:40,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:40,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:40,318 INFO L87 Difference]: Start difference. First operand 37129 states and 57633 transitions. Second operand 3 states. [2019-09-08 13:29:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:42,845 INFO L93 Difference]: Finished difference Result 109637 states and 169917 transitions. [2019-09-08 13:29:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:42,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:29:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:42,928 INFO L225 Difference]: With dead ends: 109637 [2019-09-08 13:29:42,928 INFO L226 Difference]: Without dead ends: 73408 [2019-09-08 13:29:42,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73408 states. [2019-09-08 13:29:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73408 to 37254. [2019-09-08 13:29:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37254 states. [2019-09-08 13:29:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37254 states to 37254 states and 57779 transitions. [2019-09-08 13:29:44,794 INFO L78 Accepts]: Start accepts. Automaton has 37254 states and 57779 transitions. Word has length 331 [2019-09-08 13:29:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:44,795 INFO L475 AbstractCegarLoop]: Abstraction has 37254 states and 57779 transitions. [2019-09-08 13:29:44,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 37254 states and 57779 transitions. [2019-09-08 13:29:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:29:44,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:44,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:44,832 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 536139505, now seen corresponding path program 1 times [2019-09-08 13:29:44,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:44,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:44,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:44,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:44,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:45,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 13:29:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:29:45,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:29:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:29:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:45,191 INFO L87 Difference]: Start difference. First operand 37254 states and 57779 transitions. Second operand 3 states. [2019-09-08 13:29:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:47,602 INFO L93 Difference]: Finished difference Result 93350 states and 145911 transitions. [2019-09-08 13:29:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:29:47,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:29:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:47,688 INFO L225 Difference]: With dead ends: 93350 [2019-09-08 13:29:47,689 INFO L226 Difference]: Without dead ends: 58400 [2019-09-08 13:29:47,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:29:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58400 states. [2019-09-08 13:29:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58400 to 50446. [2019-09-08 13:29:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50446 states. [2019-09-08 13:29:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50446 states to 50446 states and 79409 transitions. [2019-09-08 13:29:50,156 INFO L78 Accepts]: Start accepts. Automaton has 50446 states and 79409 transitions. Word has length 332 [2019-09-08 13:29:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:50,156 INFO L475 AbstractCegarLoop]: Abstraction has 50446 states and 79409 transitions. [2019-09-08 13:29:50,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 50446 states and 79409 transitions. [2019-09-08 13:29:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:29:50,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:50,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:50,179 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1245793770, now seen corresponding path program 1 times [2019-09-08 13:29:50,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:50,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:50,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:50,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:50,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:50,514 INFO L87 Difference]: Start difference. First operand 50446 states and 79409 transitions. Second operand 4 states. [2019-09-08 13:29:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:52,800 INFO L93 Difference]: Finished difference Result 96721 states and 152140 transitions. [2019-09-08 13:29:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:52,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 13:29:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:52,865 INFO L225 Difference]: With dead ends: 96721 [2019-09-08 13:29:52,865 INFO L226 Difference]: Without dead ends: 47138 [2019-09-08 13:29:52,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47138 states. [2019-09-08 13:29:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47138 to 47118. [2019-09-08 13:29:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47118 states. [2019-09-08 13:29:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 74148 transitions. [2019-09-08 13:29:56,681 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 74148 transitions. Word has length 332 [2019-09-08 13:29:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:56,681 INFO L475 AbstractCegarLoop]: Abstraction has 47118 states and 74148 transitions. [2019-09-08 13:29:56,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 74148 transitions. [2019-09-08 13:29:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:29:56,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:56,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:56,703 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1110227113, now seen corresponding path program 1 times [2019-09-08 13:29:56,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:56,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:56,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:56,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:29:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:29:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:29:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:29:57,257 INFO L87 Difference]: Start difference. First operand 47118 states and 74148 transitions. Second operand 10 states. [2019-09-08 13:30:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:09,249 INFO L93 Difference]: Finished difference Result 201335 states and 322110 transitions. [2019-09-08 13:30:09,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:30:09,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-08 13:30:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:09,501 INFO L225 Difference]: With dead ends: 201335 [2019-09-08 13:30:09,501 INFO L226 Difference]: Without dead ends: 156054 [2019-09-08 13:30:09,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:30:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156054 states. [2019-09-08 13:30:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156054 to 90862. [2019-09-08 13:30:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90862 states. [2019-09-08 13:30:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90862 states to 90862 states and 143417 transitions. [2019-09-08 13:30:15,261 INFO L78 Accepts]: Start accepts. Automaton has 90862 states and 143417 transitions. Word has length 333 [2019-09-08 13:30:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:15,262 INFO L475 AbstractCegarLoop]: Abstraction has 90862 states and 143417 transitions. [2019-09-08 13:30:15,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:30:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 90862 states and 143417 transitions. [2019-09-08 13:30:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:30:15,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:15,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:15,292 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1551200824, now seen corresponding path program 1 times [2019-09-08 13:30:15,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:15,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:15,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:15,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:15,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:15,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:15,979 INFO L87 Difference]: Start difference. First operand 90862 states and 143417 transitions. Second operand 4 states. [2019-09-08 13:30:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:27,988 INFO L93 Difference]: Finished difference Result 268249 states and 423389 transitions. [2019-09-08 13:30:27,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:27,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-08 13:30:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:28,315 INFO L225 Difference]: With dead ends: 268249 [2019-09-08 13:30:28,315 INFO L226 Difference]: Without dead ends: 177459 [2019-09-08 13:30:28,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:30:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177459 states. [2019-09-08 13:30:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177459 to 177457. [2019-09-08 13:30:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177457 states. [2019-09-08 13:30:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177457 states to 177457 states and 278791 transitions. [2019-09-08 13:30:42,154 INFO L78 Accepts]: Start accepts. Automaton has 177457 states and 278791 transitions. Word has length 333 [2019-09-08 13:30:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:42,154 INFO L475 AbstractCegarLoop]: Abstraction has 177457 states and 278791 transitions. [2019-09-08 13:30:42,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 177457 states and 278791 transitions. [2019-09-08 13:30:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:30:42,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:42,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:42,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1328429672, now seen corresponding path program 1 times [2019-09-08 13:30:42,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:42,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:42,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:42,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:42,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:42,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:42,449 INFO L87 Difference]: Start difference. First operand 177457 states and 278791 transitions. Second operand 3 states. [2019-09-08 13:31:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:05,582 INFO L93 Difference]: Finished difference Result 523949 states and 823375 transitions. [2019-09-08 13:31:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:05,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:31:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:06,205 INFO L225 Difference]: With dead ends: 523949 [2019-09-08 13:31:06,206 INFO L226 Difference]: Without dead ends: 347741 [2019-09-08 13:31:06,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347741 states. [2019-09-08 13:31:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347741 to 347739. [2019-09-08 13:31:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347739 states. [2019-09-08 13:31:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347739 states to 347739 states and 544512 transitions. [2019-09-08 13:31:38,229 INFO L78 Accepts]: Start accepts. Automaton has 347739 states and 544512 transitions. Word has length 335 [2019-09-08 13:31:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:38,230 INFO L475 AbstractCegarLoop]: Abstraction has 347739 states and 544512 transitions. [2019-09-08 13:31:38,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 347739 states and 544512 transitions. [2019-09-08 13:31:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:31:38,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:38,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:38,345 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash 519055583, now seen corresponding path program 1 times [2019-09-08 13:31:38,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:38,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:38,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:38,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:38,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:38,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:38,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:38,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:38,553 INFO L87 Difference]: Start difference. First operand 347739 states and 544512 transitions. Second operand 3 states. [2019-09-08 13:32:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:24,254 INFO L93 Difference]: Finished difference Result 937779 states and 1478962 transitions. [2019-09-08 13:32:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:24,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:32:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:25,329 INFO L225 Difference]: With dead ends: 937779 [2019-09-08 13:32:25,330 INFO L226 Difference]: Without dead ends: 597229 [2019-09-08 13:32:25,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597229 states. [2019-09-08 13:33:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597229 to 548859. [2019-09-08 13:33:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548859 states. [2019-09-08 13:33:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548859 states to 548859 states and 863080 transitions. [2019-09-08 13:33:20,889 INFO L78 Accepts]: Start accepts. Automaton has 548859 states and 863080 transitions. Word has length 336 [2019-09-08 13:33:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:20,890 INFO L475 AbstractCegarLoop]: Abstraction has 548859 states and 863080 transitions. [2019-09-08 13:33:20,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:33:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 548859 states and 863080 transitions. [2019-09-08 13:33:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:33:21,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:21,003 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:33:21,003 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1402597133, now seen corresponding path program 1 times [2019-09-08 13:33:21,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:21,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:33:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:21,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:33:21,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:33:21,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:33:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:33:21,271 INFO L87 Difference]: Start difference. First operand 548859 states and 863080 transitions. Second operand 3 states. [2019-09-08 13:34:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:34:45,548 INFO L93 Difference]: Finished difference Result 1562698 states and 2455698 transitions. [2019-09-08 13:34:45,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:34:45,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 13:34:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:34:47,477 INFO L225 Difference]: With dead ends: 1562698 [2019-09-08 13:34:47,477 INFO L226 Difference]: Without dead ends: 1015186 [2019-09-08 13:34:47,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015186 states. [2019-09-08 13:36:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015186 to 1015184. [2019-09-08 13:36:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015184 states. [2019-09-08 13:36:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015184 states to 1015184 states and 1585893 transitions. [2019-09-08 13:36:40,654 INFO L78 Accepts]: Start accepts. Automaton has 1015184 states and 1585893 transitions. Word has length 337 [2019-09-08 13:36:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:36:40,654 INFO L475 AbstractCegarLoop]: Abstraction has 1015184 states and 1585893 transitions. [2019-09-08 13:36:40,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:36:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1015184 states and 1585893 transitions. [2019-09-08 13:36:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:36:40,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:40,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:36:40,841 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash 775437712, now seen corresponding path program 1 times [2019-09-08 13:36:40,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:36:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:36:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:36:41,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:36:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:36:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:36:41,145 INFO L87 Difference]: Start difference. First operand 1015184 states and 1585893 transitions. Second operand 4 states. [2019-09-08 13:39:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:29,620 INFO L93 Difference]: Finished difference Result 2793454 states and 4357326 transitions. [2019-09-08 13:39:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:39:29,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-08 13:39:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:33,630 INFO L225 Difference]: With dead ends: 2793454 [2019-09-08 13:39:33,630 INFO L226 Difference]: Without dead ends: 1781562 [2019-09-08 13:39:34,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:39:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781562 states.