java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:50:19,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:50:19,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:50:19,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:50:19,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:50:19,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:50:19,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:50:19,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:50:19,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:50:19,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:50:19,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:50:19,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:50:19,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:50:19,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:50:19,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:50:19,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:50:19,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:50:19,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:50:19,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:50:19,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:50:19,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:50:19,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:50:19,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:50:19,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:50:19,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:50:19,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:50:19,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:50:19,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:50:19,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:50:19,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:50:19,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:50:19,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:50:19,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:50:19,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:50:19,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:50:19,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:50:19,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:50:19,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:50:19,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:50:19,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:50:19,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:50:19,384 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 09:50:19,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:50:19,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:50:19,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:50:19,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:50:19,403 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:50:19,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:50:19,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:50:19,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:50:19,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:50:19,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:50:19,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:50:19,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:50:19,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:50:19,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:50:19,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:50:19,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:50:19,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:50:19,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:50:19,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:50:19,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:50:19,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:50:19,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:50:19,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:50:19,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:50:19,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:50:19,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:50:19,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:50:19,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:50:19,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:50:19,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:50:19,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:50:19,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:50:19,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:50:19,456 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:50:19,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:50:19,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cdd1f353/3b0f8dfd8c054802bbf8c1a30aa6cbff/FLAG08ef846eb [2019-09-08 09:50:20,116 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:50:20,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:50:20,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cdd1f353/3b0f8dfd8c054802bbf8c1a30aa6cbff/FLAG08ef846eb [2019-09-08 09:50:20,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cdd1f353/3b0f8dfd8c054802bbf8c1a30aa6cbff [2019-09-08 09:50:20,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:50:20,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:50:20,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:50:20,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:50:20,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:50:20,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:50:20" (1/1) ... [2019-09-08 09:50:20,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c93ca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:20, skipping insertion in model container [2019-09-08 09:50:20,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:50:20" (1/1) ... [2019-09-08 09:50:20,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:50:20,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:50:21,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:50:21,053 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:50:21,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:50:21,198 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:50:21,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21 WrapperNode [2019-09-08 09:50:21,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:50:21,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:50:21,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:50:21,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:50:21,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (1/1) ... [2019-09-08 09:50:21,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:50:21,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:50:21,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:50:21,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:50:21,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (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 09:50:21,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:50:21,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:50:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:50:21,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:50:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:50:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:50:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:50:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:50:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:50:21,375 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:50:21,375 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:50:21,375 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:50:21,376 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:50:21,376 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:50:21,377 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:50:21,377 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:50:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:50:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:50:21,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:50:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:50:22,754 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:50:22,754 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:50:22,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:50:22 BoogieIcfgContainer [2019-09-08 09:50:22,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:50:22,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:50:22,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:50:22,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:50:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:50:20" (1/3) ... [2019-09-08 09:50:22,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd3cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:50:22, skipping insertion in model container [2019-09-08 09:50:22,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:50:21" (2/3) ... [2019-09-08 09:50:22,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd3cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:50:22, skipping insertion in model container [2019-09-08 09:50:22,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:50:22" (3/3) ... [2019-09-08 09:50:22,769 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 09:50:22,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:50:22,811 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:50:22,833 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:50:22,881 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:50:22,881 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:50:22,882 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:50:22,882 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:50:22,882 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:50:22,882 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:50:22,882 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:50:22,883 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:50:22,883 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:50:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-08 09:50:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 09:50:22,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:22,927 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] [2019-09-08 09:50:22,928 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-08 09:50:22,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:22,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:23,563 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 09:50:23,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:23,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:23,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:23,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:23,590 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-08 09:50:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:23,791 INFO L93 Difference]: Finished difference Result 596 states and 1028 transitions. [2019-09-08 09:50:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:23,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-08 09:50:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:23,811 INFO L225 Difference]: With dead ends: 596 [2019-09-08 09:50:23,812 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 09:50:23,817 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 09:50:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 09:50:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-08 09:50:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-08 09:50:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-08 09:50:23,907 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-08 09:50:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:23,908 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-08 09:50:23,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-08 09:50:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:50:23,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:23,914 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] [2019-09-08 09:50:23,915 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-08 09:50:23,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:23,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:23,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:24,191 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 09:50:24,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:24,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:24,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:24,195 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-08 09:50:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:24,283 INFO L93 Difference]: Finished difference Result 937 states and 1554 transitions. [2019-09-08 09:50:24,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:24,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 09:50:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:24,290 INFO L225 Difference]: With dead ends: 937 [2019-09-08 09:50:24,290 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 09:50:24,293 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 09:50:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 09:50:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-08 09:50:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 09:50:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-08 09:50:24,348 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-08 09:50:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:24,348 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-08 09:50:24,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-08 09:50:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 09:50:24,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:24,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:24,354 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-08 09:50:24,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:24,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:24,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:24,500 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 09:50:24,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:24,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:24,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:24,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:24,503 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-08 09:50:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:24,581 INFO L93 Difference]: Finished difference Result 1615 states and 2672 transitions. [2019-09-08 09:50:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:24,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 09:50:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:24,589 INFO L225 Difference]: With dead ends: 1615 [2019-09-08 09:50:24,590 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 09:50:24,592 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 09:50:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 09:50:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-08 09:50:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-08 09:50:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-08 09:50:24,651 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-08 09:50:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:24,651 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-08 09:50:24,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-08 09:50:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 09:50:24,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:24,655 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] [2019-09-08 09:50:24,655 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-08 09:50:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:24,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:24,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:24,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:24,845 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 09:50:24,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:24,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:24,847 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-08 09:50:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:24,956 INFO L93 Difference]: Finished difference Result 2911 states and 4788 transitions. [2019-09-08 09:50:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:24,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 09:50:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:24,973 INFO L225 Difference]: With dead ends: 2911 [2019-09-08 09:50:24,973 INFO L226 Difference]: Without dead ends: 1981 [2019-09-08 09:50:24,977 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 09:50:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-08 09:50:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-08 09:50:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-08 09:50:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-08 09:50:25,115 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-08 09:50:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:25,116 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-08 09:50:25,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-08 09:50:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 09:50:25,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:25,121 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] [2019-09-08 09:50:25,121 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-08 09:50:25,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:25,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:25,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:25,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:25,335 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 09:50:25,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:25,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:50:25,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:50:25,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:50:25,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:50:25,338 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-08 09:50:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:26,319 INFO L93 Difference]: Finished difference Result 10227 states and 16902 transitions. [2019-09-08 09:50:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 09:50:26,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 09:50:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:26,369 INFO L225 Difference]: With dead ends: 10227 [2019-09-08 09:50:26,370 INFO L226 Difference]: Without dead ends: 8449 [2019-09-08 09:50:26,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:50:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-08 09:50:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-08 09:50:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-08 09:50:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-08 09:50:26,765 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-08 09:50:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:26,766 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-08 09:50:26,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:50:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-08 09:50:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 09:50:26,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:26,770 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] [2019-09-08 09:50:26,771 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-08 09:50:26,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:26,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:26,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 09:50:26,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:26,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:26,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:26,990 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-08 09:50:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:27,596 INFO L93 Difference]: Finished difference Result 10711 states and 17645 transitions. [2019-09-08 09:50:27,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:50:27,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-08 09:50:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:27,649 INFO L225 Difference]: With dead ends: 10711 [2019-09-08 09:50:27,650 INFO L226 Difference]: Without dead ends: 7275 [2019-09-08 09:50:27,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-08 09:50:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-08 09:50:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-08 09:50:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-08 09:50:28,127 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-08 09:50:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:28,128 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-08 09:50:28,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:50:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-08 09:50:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:50:28,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:28,134 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] [2019-09-08 09:50:28,134 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-08 09:50:28,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:28,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:28,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:28,271 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 09:50:28,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:28,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:28,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:28,273 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-08 09:50:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:29,159 INFO L93 Difference]: Finished difference Result 15781 states and 25985 transitions. [2019-09-08 09:50:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:50:29,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 09:50:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:29,225 INFO L225 Difference]: With dead ends: 15781 [2019-09-08 09:50:29,226 INFO L226 Difference]: Without dead ends: 10590 [2019-09-08 09:50:29,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:50:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-08 09:50:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-08 09:50:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-08 09:50:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-08 09:50:29,893 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-08 09:50:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:29,894 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-08 09:50:29,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:50:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-08 09:50:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:50:29,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:29,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:50:29,901 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-08 09:50:29,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:29,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:50:30,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:30,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:30,007 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-08 09:50:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:30,846 INFO L93 Difference]: Finished difference Result 17514 states and 28795 transitions. [2019-09-08 09:50:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:30,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:50:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:30,880 INFO L225 Difference]: With dead ends: 17514 [2019-09-08 09:50:30,880 INFO L226 Difference]: Without dead ends: 12121 [2019-09-08 09:50:30,893 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 09:50:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-08 09:50:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-08 09:50:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-08 09:50:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-08 09:50:31,692 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-08 09:50:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:31,693 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-08 09:50:31,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-08 09:50:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:50:31,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:31,699 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] [2019-09-08 09:50:31,699 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-08 09:50:31,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:31,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:31,836 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 09:50:31,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:31,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:31,838 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-08 09:50:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:33,436 INFO L93 Difference]: Finished difference Result 23551 states and 38678 transitions. [2019-09-08 09:50:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:33,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:50:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:33,498 INFO L225 Difference]: With dead ends: 23551 [2019-09-08 09:50:33,499 INFO L226 Difference]: Without dead ends: 17029 [2019-09-08 09:50:33,525 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 09:50:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-08 09:50:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-08 09:50:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-08 09:50:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-08 09:50:34,648 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-08 09:50:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:34,649 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-08 09:50:34,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-08 09:50:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:50:34,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:34,652 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] [2019-09-08 09:50:34,652 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-08 09:50:34,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:34,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:34,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 09:50:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:34,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:34,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:34,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:34,779 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-08 09:50:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:36,867 INFO L93 Difference]: Finished difference Result 54386 states and 89180 transitions. [2019-09-08 09:50:36,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:50:36,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 09:50:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:36,972 INFO L225 Difference]: With dead ends: 54386 [2019-09-08 09:50:36,973 INFO L226 Difference]: Without dead ends: 37659 [2019-09-08 09:50:37,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:50:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-08 09:50:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-08 09:50:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-08 09:50:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-08 09:50:38,468 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-08 09:50:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:38,468 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-08 09:50:38,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:50:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-08 09:50:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:50:38,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:38,471 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] [2019-09-08 09:50:38,472 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-08 09:50:38,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:38,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:38,567 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 09:50:38,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:38,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:38,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:38,569 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-08 09:50:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:41,034 INFO L93 Difference]: Finished difference Result 53227 states and 87204 transitions. [2019-09-08 09:50:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:41,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:50:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:41,116 INFO L225 Difference]: With dead ends: 53227 [2019-09-08 09:50:41,117 INFO L226 Difference]: Without dead ends: 38191 [2019-09-08 09:50:41,167 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 09:50:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-08 09:50:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-08 09:50:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-08 09:50:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-08 09:50:42,835 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-08 09:50:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:42,835 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-08 09:50:42,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-08 09:50:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:50:42,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:42,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] [2019-09-08 09:50:42,839 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash -390628183, now seen corresponding path program 1 times [2019-09-08 09:50:42,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:42,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:42,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:42,954 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 09:50:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:50:42,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:50:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:50:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:50:42,957 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-08 09:50:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:46,102 INFO L93 Difference]: Finished difference Result 83696 states and 137543 transitions. [2019-09-08 09:50:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:46,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-08 09:50:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:46,194 INFO L225 Difference]: With dead ends: 83696 [2019-09-08 09:50:46,194 INFO L226 Difference]: Without dead ends: 56815 [2019-09-08 09:50:46,245 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 09:50:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-08 09:50:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-08 09:50:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-08 09:50:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-08 09:50:48,535 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-08 09:50:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:48,536 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-08 09:50:48,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:50:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-08 09:50:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 09:50:48,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:48,537 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] [2019-09-08 09:50:48,538 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-08 09:50:48,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:48,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:48,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:48,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:48,633 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 09:50:48,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:50:48,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:50:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:50:48,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:50:48,635 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-08 09:50:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:54,787 INFO L93 Difference]: Finished difference Result 182066 states and 297987 transitions. [2019-09-08 09:50:54,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:50:54,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 09:50:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:54,980 INFO L225 Difference]: With dead ends: 182066 [2019-09-08 09:50:54,980 INFO L226 Difference]: Without dead ends: 125501 [2019-09-08 09:50:55,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:50:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-08 09:50:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-08 09:50:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-08 09:50:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-08 09:50:59,256 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-08 09:50:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:59,257 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-08 09:50:59,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:50:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-08 09:50:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 09:50:59,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:59,258 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] [2019-09-08 09:50:59,258 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-08 09:50:59,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:59,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:59,480 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 09:50:59,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:59,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:50:59,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:50:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:50:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:50:59,482 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-08 09:51:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:05,060 INFO L93 Difference]: Finished difference Result 181618 states and 295756 transitions. [2019-09-08 09:51:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:51:05,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-08 09:51:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:05,209 INFO L225 Difference]: With dead ends: 181618 [2019-09-08 09:51:05,209 INFO L226 Difference]: Without dead ends: 90934 [2019-09-08 09:51:05,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:51:05,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-08 09:51:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-08 09:51:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-08 09:51:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-08 09:51:09,493 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-08 09:51:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:09,493 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-08 09:51:09,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:51:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-08 09:51:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 09:51:09,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:09,495 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] [2019-09-08 09:51:09,495 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-08 09:51:09,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:09,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:09,744 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 09:51:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:51:09,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:51:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:51:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:51:09,746 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-08 09:51:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:19,796 INFO L93 Difference]: Finished difference Result 296146 states and 481653 transitions. [2019-09-08 09:51:19,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:51:19,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-08 09:51:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:20,114 INFO L225 Difference]: With dead ends: 296146 [2019-09-08 09:51:20,115 INFO L226 Difference]: Without dead ends: 205462 [2019-09-08 09:51:20,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:51:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-08 09:51:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-08 09:51:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-08 09:51:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-08 09:51:32,699 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-08 09:51:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:32,700 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-08 09:51:32,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:51:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-08 09:51:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 09:51:32,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:32,701 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] [2019-09-08 09:51:32,701 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-08 09:51:32,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:32,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:32,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:32,876 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 09:51:32,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:32,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:51:32,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:51:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:51:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:51:32,880 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-08 09:51:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:53,487 INFO L93 Difference]: Finished difference Result 394480 states and 636518 transitions. [2019-09-08 09:51:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:51:53,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-08 09:51:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:54,184 INFO L225 Difference]: With dead ends: 394480 [2019-09-08 09:51:54,184 INFO L226 Difference]: Without dead ends: 394478 [2019-09-08 09:51:54,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:51:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-08 09:52:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-08 09:52:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-08 09:52:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-08 09:52:12,396 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-08 09:52:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:12,396 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-08 09:52:12,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:52:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-08 09:52:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:52:12,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:12,402 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:12,403 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-08 09:52:12,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:52:12,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:12,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:52:12,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:52:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:52:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:52:12,603 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-08 09:52:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:35,915 INFO L93 Difference]: Finished difference Result 468069 states and 753119 transitions. [2019-09-08 09:52:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:52:35,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:52:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:36,581 INFO L225 Difference]: With dead ends: 468069 [2019-09-08 09:52:36,581 INFO L226 Difference]: Without dead ends: 373577 [2019-09-08 09:52:36,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:52:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-08 09:53:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-08 09:53:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-08 09:53:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-08 09:53:05,628 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-08 09:53:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:05,629 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-08 09:53:05,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:53:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-08 09:53:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:53:05,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:05,634 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:53:05,635 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-08 09:53:05,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:05,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 09:53:05,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:05,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:53:05,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:53:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:53:05,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:53:05,823 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-08 09:53:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:32,121 INFO L93 Difference]: Finished difference Result 508165 states and 817743 transitions. [2019-09-08 09:53:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:53:32,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:53:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:32,815 INFO L225 Difference]: With dead ends: 508165 [2019-09-08 09:53:32,815 INFO L226 Difference]: Without dead ends: 413673 [2019-09-08 09:53:32,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:53:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-08 09:54:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-08 09:54:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-08 09:54:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-08 09:54:03,769 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-08 09:54:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:03,769 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-08 09:54:03,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:54:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-08 09:54:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:54:03,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:03,775 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:54:03,775 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-08 09:54:03,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 09:54:03,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:03,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:54:03,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:54:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:54:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:54:03,938 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-08 09:54:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:36,487 INFO L93 Difference]: Finished difference Result 533177 states and 857999 transitions. [2019-09-08 09:54:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:54:36,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:54:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:37,323 INFO L225 Difference]: With dead ends: 533177 [2019-09-08 09:54:37,324 INFO L226 Difference]: Without dead ends: 438685 [2019-09-08 09:54:37,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:54:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-08 09:55:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-08 09:55:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-08 09:55:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-08 09:55:11,959 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-08 09:55:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:11,959 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-08 09:55:11,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:55:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-08 09:55:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:55:11,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:11,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:55:11,965 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1226506444, now seen corresponding path program 1 times [2019-09-08 09:55:11,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:55:12,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:12,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:55:12,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:55:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:55:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:55:12,137 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 6 states. [2019-09-08 09:55:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:52,635 INFO L93 Difference]: Finished difference Result 675623 states and 1090211 transitions. [2019-09-08 09:55:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:55:52,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 09:55:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:54,206 INFO L225 Difference]: With dead ends: 675623 [2019-09-08 09:55:54,206 INFO L226 Difference]: Without dead ends: 564669 [2019-09-08 09:55:54,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:55:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564669 states. [2019-09-08 09:56:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564669 to 508157. [2019-09-08 09:56:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508157 states. [2019-09-08 09:56:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508157 states to 508157 states and 816726 transitions. [2019-09-08 09:56:46,001 INFO L78 Accepts]: Start accepts. Automaton has 508157 states and 816726 transitions. Word has length 167 [2019-09-08 09:56:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:46,001 INFO L475 AbstractCegarLoop]: Abstraction has 508157 states and 816726 transitions. [2019-09-08 09:56:46,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:56:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 508157 states and 816726 transitions. [2019-09-08 09:56:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:56:46,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:46,007 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:56:46,007 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 498916304, now seen corresponding path program 1 times [2019-09-08 09:56:46,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:56:46,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:46,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:46,112 INFO L87 Difference]: Start difference. First operand 508157 states and 816726 transitions. Second operand 3 states. [2019-09-08 09:57:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:49,466 INFO L93 Difference]: Finished difference Result 1009225 states and 1627774 transitions. [2019-09-08 09:57:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:49,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 09:57:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:51,221 INFO L225 Difference]: With dead ends: 1009225 [2019-09-08 09:57:51,221 INFO L226 Difference]: Without dead ends: 870701 [2019-09-08 09:57:51,506 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 09:57:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870701 states. [2019-09-08 09:59:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870701 to 869234. [2019-09-08 09:59:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869234 states. [2019-09-08 09:59:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869234 states to 869234 states and 1398676 transitions. [2019-09-08 09:59:28,339 INFO L78 Accepts]: Start accepts. Automaton has 869234 states and 1398676 transitions. Word has length 168 [2019-09-08 09:59:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:28,340 INFO L475 AbstractCegarLoop]: Abstraction has 869234 states and 1398676 transitions. [2019-09-08 09:59:28,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 869234 states and 1398676 transitions. [2019-09-08 09:59:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:59:28,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:28,349 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:59:28,349 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -699174186, now seen corresponding path program 1 times [2019-09-08 09:59:28,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:28,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:28,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:59:28,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:59:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:59:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:28,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 09:59:28,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:59:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 09:59:28,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:59:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 09:59:28,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 09:59:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 09:59:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:59:28,997 INFO L87 Difference]: Start difference. First operand 869234 states and 1398676 transitions. Second operand 12 states.