java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:27:37,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:27:37,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:27:37,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:27:37,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:27:37,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:27:37,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:27:37,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:27:37,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:27:37,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:27:37,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:27:37,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:27:37,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:27:37,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:27:37,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:27:37,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:27:37,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:27:37,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:27:37,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:27:37,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:27:37,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:27:37,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:27:37,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:27:37,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:27:37,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:27:37,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:27:37,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:27:37,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:27:37,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:27:37,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:27:37,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:27:37,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:27:37,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:27:37,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:27:37,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:27:37,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:27:37,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:27:37,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:27:37,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:27:37,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:27:37,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:27:37,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:27:37,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:27:37,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:27:37,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:27:37,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:27:37,416 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:27:37,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:27:37,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:27:37,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:27:37,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:27:37,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:27:37,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:27:37,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:27:37,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:27:37,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:27:37,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:27:37,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:27:37,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:27:37,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:27:37,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:27:37,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:27:37,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:27:37,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:27:37,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:27:37,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:27:37,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:27:37,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:27:37,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:27:37,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:27:37,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:27:37,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:27:37,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:27:37,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:27:37,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:27:37,480 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:27:37,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:27:37,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc1b158d/3b214493af9f43c28aa0aadb5d25e12a/FLAGeafc8672e [2019-09-08 13:27:38,062 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:27:38,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:27:38,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc1b158d/3b214493af9f43c28aa0aadb5d25e12a/FLAGeafc8672e [2019-09-08 13:27:38,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc1b158d/3b214493af9f43c28aa0aadb5d25e12a [2019-09-08 13:27:38,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:27:38,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:27:38,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:27:38,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:27:38,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:27:38,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:27:38" (1/1) ... [2019-09-08 13:27:38,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:38, skipping insertion in model container [2019-09-08 13:27:38,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:27:38" (1/1) ... [2019-09-08 13:27:38,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:27:38,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:27:38,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:27:38,925 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:27:39,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:27:39,095 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:27:39,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39 WrapperNode [2019-09-08 13:27:39,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:27:39,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:27:39,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:27:39,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:27:39,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... [2019-09-08 13:27:39,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:27:39,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:27:39,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:27:39,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:27:39,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:27:39,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:27:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:27:39,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:27:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:27:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:27:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:27:39,295 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:27:39,296 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:27:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:27:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:27:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:27:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:27:39,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:27:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:27:40,593 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:27:40,593 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:27:40,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:27:40 BoogieIcfgContainer [2019-09-08 13:27:40,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:27:40,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:27:40,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:27:40,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:27:40,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:27:38" (1/3) ... [2019-09-08 13:27:40,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360e1f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:27:40, skipping insertion in model container [2019-09-08 13:27:40,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:27:39" (2/3) ... [2019-09-08 13:27:40,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360e1f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:27:40, skipping insertion in model container [2019-09-08 13:27:40,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:27:40" (3/3) ... [2019-09-08 13:27:40,603 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:27:40,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:27:40,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:27:40,643 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:27:40,688 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:27:40,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:27:40,689 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:27:40,689 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:27:40,689 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:27:40,689 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:27:40,690 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:27:40,690 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:27:40,690 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:27:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-08 13:27:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:27:40,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:40,755 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] [2019-09-08 13:27:40,756 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-08 13:27:40,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:40,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:41,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:41,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:41,466 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-08 13:27:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:41,628 INFO L93 Difference]: Finished difference Result 635 states and 1098 transitions. [2019-09-08 13:27:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:41,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:27:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:41,650 INFO L225 Difference]: With dead ends: 635 [2019-09-08 13:27:41,650 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 13:27:41,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 13:27:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-08 13:27:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-08 13:27:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-08 13:27:41,744 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-08 13:27:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:41,745 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-08 13:27:41,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-08 13:27:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:27:41,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:41,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:27:41,749 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-08 13:27:41,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:41,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:41,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:41,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:41,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:41,969 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-08 13:27:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:42,020 INFO L93 Difference]: Finished difference Result 1011 states and 1679 transitions. [2019-09-08 13:27:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:42,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:27:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:42,026 INFO L225 Difference]: With dead ends: 1011 [2019-09-08 13:27:42,027 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 13:27:42,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 13:27:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-08 13:27:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-08 13:27:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-08 13:27:42,082 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-08 13:27:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:42,083 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-08 13:27:42,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-08 13:27:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:27:42,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:42,088 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 13:27:42,088 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-08 13:27:42,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:42,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:42,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:42,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:42,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:42,282 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-08 13:27:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:42,340 INFO L93 Difference]: Finished difference Result 1759 states and 2924 transitions. [2019-09-08 13:27:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:42,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:27:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:42,352 INFO L225 Difference]: With dead ends: 1759 [2019-09-08 13:27:42,352 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 13:27:42,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 13:27:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-08 13:27:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-08 13:27:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-08 13:27:42,416 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-08 13:27:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:42,418 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-08 13:27:42,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-08 13:27:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:27:42,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:42,422 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] [2019-09-08 13:27:42,422 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-08 13:27:42,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:42,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:42,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:42,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:42,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:42,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:42,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:42,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:42,630 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-08 13:27:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:42,732 INFO L93 Difference]: Finished difference Result 3195 states and 5300 transitions. [2019-09-08 13:27:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:42,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:27:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:42,746 INFO L225 Difference]: With dead ends: 3195 [2019-09-08 13:27:42,746 INFO L226 Difference]: Without dead ends: 2169 [2019-09-08 13:27:42,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-08 13:27:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-08 13:27:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-08 13:27:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-08 13:27:42,826 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-08 13:27:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:42,826 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-08 13:27:42,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-08 13:27:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:27:42,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:42,830 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] [2019-09-08 13:27:42,830 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-08 13:27:42,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:42,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:43,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:43,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:27:43,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:27:43,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:27:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:27:43,078 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-08 13:27:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:43,670 INFO L93 Difference]: Finished difference Result 8233 states and 13695 transitions. [2019-09-08 13:27:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:27:43,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:27:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:43,701 INFO L225 Difference]: With dead ends: 8233 [2019-09-08 13:27:43,702 INFO L226 Difference]: Without dead ends: 6263 [2019-09-08 13:27:43,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:27:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-08 13:27:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-08 13:27:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-08 13:27:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-08 13:27:43,989 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-08 13:27:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:43,989 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-08 13:27:43,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:27:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-08 13:27:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:27:43,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:43,995 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 13:27:43,995 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-08 13:27:43,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:43,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:43,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:27:44,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:27:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:27:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:44,235 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-08 13:27:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:44,637 INFO L93 Difference]: Finished difference Result 13059 states and 21734 transitions. [2019-09-08 13:27:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:27:44,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:27:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:44,678 INFO L225 Difference]: With dead ends: 13059 [2019-09-08 13:27:44,678 INFO L226 Difference]: Without dead ends: 8327 [2019-09-08 13:27:44,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-08 13:27:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-08 13:27:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 13:27:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-08 13:27:45,134 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-08 13:27:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:45,135 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-08 13:27:45,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:27:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-08 13:27:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:27:45,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:45,141 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 13:27:45,141 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-08 13:27:45,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:45,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:45,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:45,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:45,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:45,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:45,241 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-08 13:27:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:45,749 INFO L93 Difference]: Finished difference Result 16045 states and 26759 transitions. [2019-09-08 13:27:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:45,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:27:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:45,804 INFO L225 Difference]: With dead ends: 16045 [2019-09-08 13:27:45,804 INFO L226 Difference]: Without dead ends: 11099 [2019-09-08 13:27:45,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-08 13:27:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-08 13:27:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-08 13:27:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-08 13:27:46,268 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-08 13:27:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:46,268 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-08 13:27:46,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-08 13:27:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:27:46,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:46,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:27:46,272 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-08 13:27:46,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:46,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:46,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:46,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:46,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:46,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:46,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:46,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:46,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:46,469 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-08 13:27:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:46,932 INFO L93 Difference]: Finished difference Result 21684 states and 36050 transitions. [2019-09-08 13:27:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:46,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:27:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:46,983 INFO L225 Difference]: With dead ends: 21684 [2019-09-08 13:27:46,983 INFO L226 Difference]: Without dead ends: 15670 [2019-09-08 13:27:47,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-08 13:27:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-08 13:27:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-08 13:27:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-08 13:27:47,716 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-08 13:27:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:47,717 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-08 13:27:47,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-08 13:27:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:27:47,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:47,720 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 13:27:47,720 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-08 13:27:47,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:47,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:47,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:47,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:47,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:27:47,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:27:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:27:47,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:47,868 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-08 13:27:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:48,967 INFO L93 Difference]: Finished difference Result 42122 states and 69934 transitions. [2019-09-08 13:27:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:27:48,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:27:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:49,031 INFO L225 Difference]: With dead ends: 42122 [2019-09-08 13:27:49,032 INFO L226 Difference]: Without dead ends: 26712 [2019-09-08 13:27:49,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-08 13:27:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-08 13:27:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-08 13:27:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-08 13:27:50,829 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-08 13:27:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:50,830 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-08 13:27:50,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:27:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-08 13:27:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:27:50,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:50,833 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 13:27:50,833 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-08 13:27:50,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:50,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:50,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:50,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:50,975 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-08 13:27:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:52,009 INFO L93 Difference]: Finished difference Result 48435 states and 80219 transitions. [2019-09-08 13:27:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:52,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:27:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:52,090 INFO L225 Difference]: With dead ends: 48435 [2019-09-08 13:27:52,090 INFO L226 Difference]: Without dead ends: 33980 [2019-09-08 13:27:52,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-08 13:27:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-08 13:27:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-08 13:27:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-08 13:27:53,403 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-08 13:27:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:53,403 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-08 13:27:53,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-08 13:27:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:27:53,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:53,405 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 13:27:53,406 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-08 13:27:53,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:53,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:53,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:53,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:53,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:53,494 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-08 13:27:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:55,408 INFO L93 Difference]: Finished difference Result 74043 states and 122228 transitions. [2019-09-08 13:27:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:55,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:27:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:55,531 INFO L225 Difference]: With dead ends: 74043 [2019-09-08 13:27:55,532 INFO L226 Difference]: Without dead ends: 50517 [2019-09-08 13:27:55,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-08 13:27:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-08 13:27:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-08 13:27:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-08 13:27:57,266 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-08 13:27:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:57,267 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-08 13:27:57,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-08 13:27:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:27:57,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:57,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:27:57,269 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-08 13:27:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:57,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:57,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:57,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:57,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:57,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:27:57,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:27:57,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:27:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:27:57,414 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-08 13:28:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:04,390 INFO L93 Difference]: Finished difference Result 235795 states and 387004 transitions. [2019-09-08 13:28:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:28:04,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:28:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:04,666 INFO L225 Difference]: With dead ends: 235795 [2019-09-08 13:28:04,666 INFO L226 Difference]: Without dead ends: 185545 [2019-09-08 13:28:04,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:28:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-08 13:28:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-08 13:28:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-08 13:28:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-08 13:28:11,940 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-08 13:28:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:11,941 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-08 13:28:11,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:28:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-08 13:28:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:28:11,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:11,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:28:11,942 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-08 13:28:11,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:11,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:12,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:12,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:12,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:12,044 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-08 13:28:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:23,381 INFO L93 Difference]: Finished difference Result 414543 states and 675293 transitions. [2019-09-08 13:28:23,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:28:23,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:28:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:23,805 INFO L225 Difference]: With dead ends: 414543 [2019-09-08 13:28:23,805 INFO L226 Difference]: Without dead ends: 274270 [2019-09-08 13:28:23,945 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 13:28:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-08 13:28:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-08 13:28:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-08 13:28:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-08 13:28:36,088 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-08 13:28:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:36,089 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-08 13:28:36,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:28:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-08 13:28:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:28:36,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:36,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:28:36,090 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-08 13:28:36,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:36,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:36,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:36,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:36,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:28:36,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:28:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:28:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:28:36,422 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-08 13:28:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:52,591 INFO L93 Difference]: Finished difference Result 505595 states and 822137 transitions. [2019-09-08 13:28:52,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:28:52,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:28:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:53,032 INFO L225 Difference]: With dead ends: 505595 [2019-09-08 13:28:53,033 INFO L226 Difference]: Without dead ends: 298865 [2019-09-08 13:28:53,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:28:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-08 13:29:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-08 13:29:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-08 13:29:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-08 13:29:14,154 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-08 13:29:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:14,155 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-08 13:29:14,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:29:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-08 13:29:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:29:14,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:14,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:14,156 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-08 13:29:14,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:14,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:14,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:14,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:14,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:14,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:29:14,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:29:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:29:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:29:14,404 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-08 13:29:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:42,994 INFO L93 Difference]: Finished difference Result 672497 states and 1092516 transitions. [2019-09-08 13:29:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:29:42,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:29:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:43,691 INFO L225 Difference]: With dead ends: 672497 [2019-09-08 13:29:43,691 INFO L226 Difference]: Without dead ends: 436607 [2019-09-08 13:29:43,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:29:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436607 states. [2019-09-08 13:30:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436607 to 420187. [2019-09-08 13:30:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-08 13:30:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-08 13:30:15,922 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-08 13:30:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:15,923 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-08 13:30:15,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:30:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-08 13:30:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:30:15,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:15,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:15,924 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-08 13:30:15,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:15,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:15,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:15,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:15,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:16,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:16,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:30:16,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:30:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:30:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:30:16,074 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-08 13:30:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:59,831 INFO L93 Difference]: Finished difference Result 704203 states and 1136909 transitions. [2019-09-08 13:30:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:30:59,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:30:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:00,934 INFO L225 Difference]: With dead ends: 704203 [2019-09-08 13:31:00,935 INFO L226 Difference]: Without dead ends: 704201 [2019-09-08 13:31:01,069 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 13:31:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-08 13:31:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-08 13:31:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-08 13:31:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-08 13:31:44,228 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-08 13:31:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:44,228 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-08 13:31:44,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:31:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-08 13:31:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:31:44,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:44,238 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, 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, 1, 1, 1] [2019-09-08 13:31:44,238 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-08 13:31:44,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:44,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:44,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:44,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:31:44,414 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:31:44,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:44,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:31:44,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:31:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:31:44,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:31:44,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:31:44,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:31:44,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:31:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:31:44,851 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 9 states. [2019-09-08 13:32:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:51,266 INFO L93 Difference]: Finished difference Result 997546 states and 1618845 transitions. [2019-09-08 13:32:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:32:51,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2019-09-08 13:32:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:53,834 INFO L225 Difference]: With dead ends: 997546 [2019-09-08 13:32:53,835 INFO L226 Difference]: Without dead ends: 878032 [2019-09-08 13:32:54,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:32:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878032 states. [2019-09-08 13:34:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878032 to 683792. [2019-09-08 13:34:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683792 states. [2019-09-08 13:34:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683792 states to 683792 states and 1104766 transitions. [2019-09-08 13:34:03,355 INFO L78 Accepts]: Start accepts. Automaton has 683792 states and 1104766 transitions. Word has length 178 [2019-09-08 13:34:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:03,356 INFO L475 AbstractCegarLoop]: Abstraction has 683792 states and 1104766 transitions. [2019-09-08 13:34:03,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:34:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 683792 states and 1104766 transitions. [2019-09-08 13:34:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:34:03,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:03,368 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, 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, 1, 1, 1] [2019-09-08 13:34:03,368 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1203955643, now seen corresponding path program 1 times [2019-09-08 13:34:03,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:03,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:03,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:03,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:34:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:34:03,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:34:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:34:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:34:03,583 INFO L87 Difference]: Start difference. First operand 683792 states and 1104766 transitions. Second operand 6 states. [2019-09-08 13:35:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:35:19,114 INFO L93 Difference]: Finished difference Result 1286061 states and 2083946 transitions. [2019-09-08 13:35:19,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:35:19,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-08 13:35:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:35:20,761 INFO L225 Difference]: With dead ends: 1286061 [2019-09-08 13:35:20,762 INFO L226 Difference]: Without dead ends: 857218 [2019-09-08 13:35:21,115 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 13:35:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857218 states. [2019-09-08 13:36:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857218 to 787516. [2019-09-08 13:36:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787516 states. [2019-09-08 13:36:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787516 states to 787516 states and 1272075 transitions. [2019-09-08 13:36:39,623 INFO L78 Accepts]: Start accepts. Automaton has 787516 states and 1272075 transitions. Word has length 178 [2019-09-08 13:36:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:36:39,624 INFO L475 AbstractCegarLoop]: Abstraction has 787516 states and 1272075 transitions. [2019-09-08 13:36:39,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:36:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 787516 states and 1272075 transitions. [2019-09-08 13:36:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:36:39,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:36:39,630 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, 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, 1, 1, 1] [2019-09-08 13:36:39,631 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:36:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:36:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-08 13:36:39,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:36:39,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:36:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:39,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:36:39,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:36:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:36:39,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:36:39,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:36:39,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:36:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:36:40,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:36:40,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:36:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 13:36:40,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:36:40,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:36:40,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:36:40,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:36:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:36:40,180 INFO L87 Difference]: Start difference. First operand 787516 states and 1272075 transitions. Second operand 9 states. [2019-09-08 13:38:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:10,321 INFO L93 Difference]: Finished difference Result 1422066 states and 2306306 transitions. [2019-09-08 13:38:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 13:38:10,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2019-09-08 13:38:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:12,291 INFO L225 Difference]: With dead ends: 1422066 [2019-09-08 13:38:12,291 INFO L226 Difference]: Without dead ends: 1118542 [2019-09-08 13:38:12,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:38:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118542 states.