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/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:45:38,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:45:38,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:45:38,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:45:38,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:45:38,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:45:38,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:45:38,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:45:38,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:45:38,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:45:38,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:45:38,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:45:38,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:45:38,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:45:38,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:45:38,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:45:38,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:45:38,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:45:38,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:45:38,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:45:38,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:45:38,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:45:38,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:45:38,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:45:38,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:45:38,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:45:38,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:45:38,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:45:38,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:45:38,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:45:38,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:45:38,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:45:38,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:45:38,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:45:38,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:45:38,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:45:38,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:45:38,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:45:38,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:45:38,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:45:38,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:45:38,610 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-10-14 23:45:38,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:45:38,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:45:38,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:45:38,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:45:38,639 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:45:38,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:45:38,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:45:38,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:45:38,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:45:38,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:45:38,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:45:38,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:45:38,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:45:38,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:45:38,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:45:38,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:45:38,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:38,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:45:38,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:45:38,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:45:38,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:45:38,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:45:38,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:45:38,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:45:38,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:45:38,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:45:38,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:45:38,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:45:38,931 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:45:38,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-14 23:45:39,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c13f6977/3580628c8a1342d49cec00c0c101e7b6/FLAGa219a8e6c [2019-10-14 23:45:39,550 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:45:39,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-14 23:45:39,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c13f6977/3580628c8a1342d49cec00c0c101e7b6/FLAGa219a8e6c [2019-10-14 23:45:39,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c13f6977/3580628c8a1342d49cec00c0c101e7b6 [2019-10-14 23:45:39,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:45:39,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:45:39,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:39,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:45:39,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:45:39,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:39" (1/1) ... [2019-10-14 23:45:39,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b22563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:39, skipping insertion in model container [2019-10-14 23:45:39,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:39" (1/1) ... [2019-10-14 23:45:39,877 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:45:39,917 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:45:40,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:40,297 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:45:40,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:40,385 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:45:40,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40 WrapperNode [2019-10-14 23:45:40,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:40,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:45:40,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:45:40,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:45:40,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (1/1) ... [2019-10-14 23:45:40,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:45:40,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:45:40,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:45:40,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:45:40,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (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-10-14 23:45:40,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-14 23:45:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-14 23:45:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-14 23:45:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-14 23:45:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-14 23:45:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-14 23:45:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-14 23:45:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-14 23:45:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:45:40,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-14 23:45:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:45:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:45:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:45:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:45:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:45:41,306 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:45:41,307 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:45:41,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:41 BoogieIcfgContainer [2019-10-14 23:45:41,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:45:41,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:45:41,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:45:41,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:45:41,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:39" (1/3) ... [2019-10-14 23:45:41,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c608f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:41, skipping insertion in model container [2019-10-14 23:45:41,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:40" (2/3) ... [2019-10-14 23:45:41,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c608f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:41, skipping insertion in model container [2019-10-14 23:45:41,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:41" (3/3) ... [2019-10-14 23:45:41,316 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-14 23:45:41,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:45:41,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:45:41,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:45:41,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:45:41,371 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:45:41,371 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:45:41,371 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:45:41,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:45:41,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:45:41,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:45:41,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:45:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-10-14 23:45:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:45:41,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:41,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:41,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-10-14 23:45:41,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:41,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415559705] [2019-10-14 23:45:41,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:41,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:41,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:41,860 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:45:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:41,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415559705] [2019-10-14 23:45:41,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:41,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:41,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098795328] [2019-10-14 23:45:41,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:41,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:41,914 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 5 states. [2019-10-14 23:45:42,282 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-14 23:45:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:43,652 INFO L93 Difference]: Finished difference Result 423 states and 685 transitions. [2019-10-14 23:45:43,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:43,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 23:45:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:43,670 INFO L225 Difference]: With dead ends: 423 [2019-10-14 23:45:43,671 INFO L226 Difference]: Without dead ends: 217 [2019-10-14 23:45:43,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-14 23:45:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-10-14 23:45:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-14 23:45:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-10-14 23:45:43,767 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-10-14 23:45:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:43,768 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-10-14 23:45:43,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-10-14 23:45:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:45:43,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:43,771 INFO L380 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] [2019-10-14 23:45:43,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-10-14 23:45:43,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:43,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571766770] [2019-10-14 23:45:43,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:43,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:43,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:43,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571766770] [2019-10-14 23:45:43,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:43,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:43,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766795706] [2019-10-14 23:45:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:43,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:43,970 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 5 states. [2019-10-14 23:45:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:45,378 INFO L93 Difference]: Finished difference Result 433 states and 651 transitions. [2019-10-14 23:45:45,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:45,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 23:45:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:45,383 INFO L225 Difference]: With dead ends: 433 [2019-10-14 23:45:45,384 INFO L226 Difference]: Without dead ends: 231 [2019-10-14 23:45:45,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-14 23:45:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2019-10-14 23:45:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-14 23:45:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-10-14 23:45:45,428 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-10-14 23:45:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:45,429 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-10-14 23:45:45,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-10-14 23:45:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:45:45,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:45,431 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:45:45,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-10-14 23:45:45,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:45,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47499114] [2019-10-14 23:45:45,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:45,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:45,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:45,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47499114] [2019-10-14 23:45:45,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:45,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:45,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069165125] [2019-10-14 23:45:45,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:45,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:45,651 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 4 states. [2019-10-14 23:45:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:46,707 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2019-10-14 23:45:46,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:46,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:45:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:46,713 INFO L225 Difference]: With dead ends: 465 [2019-10-14 23:45:46,713 INFO L226 Difference]: Without dead ends: 257 [2019-10-14 23:45:46,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-14 23:45:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2019-10-14 23:45:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-14 23:45:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-10-14 23:45:46,745 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-10-14 23:45:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:46,745 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-10-14 23:45:46,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-10-14 23:45:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:45:46,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:46,748 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:45:46,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-10-14 23:45:46,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:46,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721753479] [2019-10-14 23:45:46,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:46,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:46,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:46,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721753479] [2019-10-14 23:45:46,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:46,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:46,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845503251] [2019-10-14 23:45:46,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:46,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:46,936 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 6 states. [2019-10-14 23:45:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:48,505 INFO L93 Difference]: Finished difference Result 442 states and 655 transitions. [2019-10-14 23:45:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:48,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 23:45:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:48,510 INFO L225 Difference]: With dead ends: 442 [2019-10-14 23:45:48,510 INFO L226 Difference]: Without dead ends: 238 [2019-10-14 23:45:48,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-14 23:45:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2019-10-14 23:45:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-14 23:45:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-10-14 23:45:48,552 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-10-14 23:45:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:48,553 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-10-14 23:45:48,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-10-14 23:45:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:45:48,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:48,561 INFO L380 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] [2019-10-14 23:45:48,561 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-10-14 23:45:48,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:48,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994087520] [2019-10-14 23:45:48,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:48,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:48,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:48,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994087520] [2019-10-14 23:45:48,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:48,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:48,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345331990] [2019-10-14 23:45:48,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:48,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:48,756 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 5 states. [2019-10-14 23:45:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:49,911 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2019-10-14 23:45:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:49,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-14 23:45:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:49,915 INFO L225 Difference]: With dead ends: 403 [2019-10-14 23:45:49,915 INFO L226 Difference]: Without dead ends: 230 [2019-10-14 23:45:49,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-14 23:45:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2019-10-14 23:45:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-14 23:45:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-14 23:45:49,937 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-10-14 23:45:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:49,937 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-14 23:45:49,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-14 23:45:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:45:49,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:49,939 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:45:49,939 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-10-14 23:45:49,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:49,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272154790] [2019-10-14 23:45:49,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:49,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:49,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:45:50,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272154790] [2019-10-14 23:45:50,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:50,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:50,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625397821] [2019-10-14 23:45:50,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:50,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:50,071 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 5 states. [2019-10-14 23:45:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:51,378 INFO L93 Difference]: Finished difference Result 452 states and 664 transitions. [2019-10-14 23:45:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:51,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-14 23:45:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:51,383 INFO L225 Difference]: With dead ends: 452 [2019-10-14 23:45:51,383 INFO L226 Difference]: Without dead ends: 249 [2019-10-14 23:45:51,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-14 23:45:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2019-10-14 23:45:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-14 23:45:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-10-14 23:45:51,425 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-10-14 23:45:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:51,426 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-10-14 23:45:51,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-10-14 23:45:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:45:51,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:51,428 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:45:51,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-10-14 23:45:51,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:51,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108948224] [2019-10-14 23:45:51,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:51,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:45:51,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108948224] [2019-10-14 23:45:51,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:51,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:51,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130320109] [2019-10-14 23:45:51,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:51,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:51,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:51,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:51,615 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 5 states. [2019-10-14 23:45:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:53,002 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2019-10-14 23:45:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:53,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-14 23:45:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:53,006 INFO L225 Difference]: With dead ends: 472 [2019-10-14 23:45:53,006 INFO L226 Difference]: Without dead ends: 255 [2019-10-14 23:45:53,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-14 23:45:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-10-14 23:45:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-14 23:45:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-10-14 23:45:53,027 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-10-14 23:45:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:53,027 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-10-14 23:45:53,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-10-14 23:45:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:45:53,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:53,029 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-14 23:45:53,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-10-14 23:45:53,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:53,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160757381] [2019-10-14 23:45:53,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:53,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:53,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:45:53,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160757381] [2019-10-14 23:45:53,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:53,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:53,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916407195] [2019-10-14 23:45:53,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:53,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:53,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:53,201 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 6 states. [2019-10-14 23:45:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:54,646 INFO L93 Difference]: Finished difference Result 471 states and 679 transitions. [2019-10-14 23:45:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:54,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-14 23:45:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:54,650 INFO L225 Difference]: With dead ends: 471 [2019-10-14 23:45:54,650 INFO L226 Difference]: Without dead ends: 255 [2019-10-14 23:45:54,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-14 23:45:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-10-14 23:45:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-14 23:45:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-10-14 23:45:54,683 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-10-14 23:45:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:54,687 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-10-14 23:45:54,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-10-14 23:45:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 23:45:54,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:54,692 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-14 23:45:54,703 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-10-14 23:45:54,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:54,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596999859] [2019-10-14 23:45:54,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:54,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:54,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-14 23:45:54,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596999859] [2019-10-14 23:45:54,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:54,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:54,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366443265] [2019-10-14 23:45:54,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:54,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:54,951 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 5 states. [2019-10-14 23:45:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:56,254 INFO L93 Difference]: Finished difference Result 485 states and 701 transitions. [2019-10-14 23:45:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:56,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-14 23:45:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:56,258 INFO L225 Difference]: With dead ends: 485 [2019-10-14 23:45:56,258 INFO L226 Difference]: Without dead ends: 274 [2019-10-14 23:45:56,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-14 23:45:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2019-10-14 23:45:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-14 23:45:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-10-14 23:45:56,281 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-10-14 23:45:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:56,282 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-10-14 23:45:56,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-10-14 23:45:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-14 23:45:56,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:56,283 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-14 23:45:56,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-10-14 23:45:56,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:56,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148990990] [2019-10-14 23:45:56,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:56,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:56,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-14 23:45:56,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148990990] [2019-10-14 23:45:56,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:56,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:56,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755515049] [2019-10-14 23:45:56,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:56,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:56,448 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 5 states. [2019-10-14 23:45:56,868 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-14 23:45:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:57,863 INFO L93 Difference]: Finished difference Result 492 states and 705 transitions. [2019-10-14 23:45:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:57,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-14 23:45:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:57,867 INFO L225 Difference]: With dead ends: 492 [2019-10-14 23:45:57,867 INFO L226 Difference]: Without dead ends: 265 [2019-10-14 23:45:57,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:45:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-14 23:45:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2019-10-14 23:45:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-14 23:45:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-10-14 23:45:57,893 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-10-14 23:45:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:57,894 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-10-14 23:45:57,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-10-14 23:45:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-14 23:45:57,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:57,896 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-14 23:45:57,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-10-14 23:45:57,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:57,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060150665] [2019-10-14 23:45:57,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:57,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:57,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,057 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:45:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-14 23:45:58,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060150665] [2019-10-14 23:45:58,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:58,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:58,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53396776] [2019-10-14 23:45:58,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:58,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:58,110 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 6 states. [2019-10-14 23:45:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:59,524 INFO L93 Difference]: Finished difference Result 479 states and 672 transitions. [2019-10-14 23:45:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:59,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-14 23:45:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:59,528 INFO L225 Difference]: With dead ends: 479 [2019-10-14 23:45:59,528 INFO L226 Difference]: Without dead ends: 267 [2019-10-14 23:45:59,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-14 23:45:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2019-10-14 23:45:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-14 23:45:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-10-14 23:45:59,550 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-10-14 23:45:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:59,551 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-10-14 23:45:59,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-10-14 23:45:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-14 23:45:59,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:59,552 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:45:59,553 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-10-14 23:45:59,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:59,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094439892] [2019-10-14 23:45:59,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:59,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:59,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:45:59,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094439892] [2019-10-14 23:45:59,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:59,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:59,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558988570] [2019-10-14 23:45:59,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:59,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:59,699 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 5 states. [2019-10-14 23:46:00,047 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 23:46:00,160 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-14 23:46:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:00,856 INFO L93 Difference]: Finished difference Result 468 states and 670 transitions. [2019-10-14 23:46:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:00,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-14 23:46:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:00,859 INFO L225 Difference]: With dead ends: 468 [2019-10-14 23:46:00,860 INFO L226 Difference]: Without dead ends: 263 [2019-10-14 23:46:00,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-14 23:46:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2019-10-14 23:46:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-14 23:46:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-10-14 23:46:00,881 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-10-14 23:46:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:00,881 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-10-14 23:46:00,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-10-14 23:46:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-14 23:46:00,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:00,883 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-14 23:46:00,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-10-14 23:46:00,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:00,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055186850] [2019-10-14 23:46:00,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:00,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:00,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-14 23:46:01,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055186850] [2019-10-14 23:46:01,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331001764] [2019-10-14 23:46:01,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:46:01,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-14 23:46:01,300 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:01,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 23:46:01,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662494067] [2019-10-14 23:46:01,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:01,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:01,302 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 5 states. [2019-10-14 23:46:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:03,069 INFO L93 Difference]: Finished difference Result 598 states and 830 transitions. [2019-10-14 23:46:03,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:03,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-14 23:46:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:03,075 INFO L225 Difference]: With dead ends: 598 [2019-10-14 23:46:03,075 INFO L226 Difference]: Without dead ends: 356 [2019-10-14 23:46:03,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-14 23:46:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2019-10-14 23:46:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:46:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-10-14 23:46:03,132 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 100 [2019-10-14 23:46:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:03,133 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-10-14 23:46:03,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-10-14 23:46:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:46:03,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:03,138 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:46:03,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:03,347 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1993729478, now seen corresponding path program 1 times [2019-10-14 23:46:03,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:03,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115254224] [2019-10-14 23:46:03,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:03,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:03,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,550 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:46:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-14 23:46:03,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115254224] [2019-10-14 23:46:03,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:03,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:03,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656094104] [2019-10-14 23:46:03,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:03,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:03,688 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 5 states. [2019-10-14 23:46:04,051 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 23:46:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:04,926 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2019-10-14 23:46:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:04,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-14 23:46:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:04,931 INFO L225 Difference]: With dead ends: 481 [2019-10-14 23:46:04,931 INFO L226 Difference]: Without dead ends: 297 [2019-10-14 23:46:04,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-14 23:46:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2019-10-14 23:46:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-14 23:46:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 397 transitions. [2019-10-14 23:46:04,972 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 397 transitions. Word has length 141 [2019-10-14 23:46:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:04,975 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 397 transitions. [2019-10-14 23:46:04,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 397 transitions. [2019-10-14 23:46:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-14 23:46:04,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:04,979 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:46:04,979 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1356364028, now seen corresponding path program 1 times [2019-10-14 23:46:04,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:04,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672889418] [2019-10-14 23:46:04,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:04,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:04,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-14 23:46:05,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672889418] [2019-10-14 23:46:05,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:05,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:05,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690770836] [2019-10-14 23:46:05,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:05,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:05,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:05,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:05,236 INFO L87 Difference]: Start difference. First operand 293 states and 397 transitions. Second operand 5 states. [2019-10-14 23:46:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:06,504 INFO L93 Difference]: Finished difference Result 470 states and 650 transitions. [2019-10-14 23:46:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:06,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-14 23:46:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:06,508 INFO L225 Difference]: With dead ends: 470 [2019-10-14 23:46:06,508 INFO L226 Difference]: Without dead ends: 285 [2019-10-14 23:46:06,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-14 23:46:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-10-14 23:46:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-14 23:46:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 378 transitions. [2019-10-14 23:46:06,533 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 378 transitions. Word has length 143 [2019-10-14 23:46:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:06,533 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 378 transitions. [2019-10-14 23:46:06,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 378 transitions. [2019-10-14 23:46:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-14 23:46:06,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:06,535 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2019-10-14 23:46:06,536 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-10-14 23:46:06,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:06,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153168506] [2019-10-14 23:46:06,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:06,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-14 23:46:06,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153168506] [2019-10-14 23:46:06,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476507369] [2019-10-14 23:46:06,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:46:07,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 23:46:07,056 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:07,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-14 23:46:07,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91033238] [2019-10-14 23:46:07,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:07,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:07,058 INFO L87 Difference]: Start difference. First operand 281 states and 378 transitions. Second operand 6 states. [2019-10-14 23:46:07,436 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 23:46:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:08,592 INFO L93 Difference]: Finished difference Result 587 states and 797 transitions. [2019-10-14 23:46:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:08,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-14 23:46:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:08,596 INFO L225 Difference]: With dead ends: 587 [2019-10-14 23:46:08,597 INFO L226 Difference]: Without dead ends: 329 [2019-10-14 23:46:08,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-14 23:46:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2019-10-14 23:46:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-14 23:46:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 425 transitions. [2019-10-14 23:46:08,623 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 425 transitions. Word has length 144 [2019-10-14 23:46:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:08,623 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 425 transitions. [2019-10-14 23:46:08,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 425 transitions. [2019-10-14 23:46:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-14 23:46:08,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:08,626 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:46:08,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:08,830 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:08,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:08,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1984275244, now seen corresponding path program 2 times [2019-10-14 23:46:08,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:08,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421599622] [2019-10-14 23:46:08,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:08,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:08,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-10-14 23:46:09,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421599622] [2019-10-14 23:46:09,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:09,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:46:09,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291808703] [2019-10-14 23:46:09,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:09,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:09,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:09,174 INFO L87 Difference]: Start difference. First operand 319 states and 425 transitions. Second operand 6 states. [2019-10-14 23:46:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:10,632 INFO L93 Difference]: Finished difference Result 495 states and 677 transitions. [2019-10-14 23:46:10,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:10,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-14 23:46:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:10,637 INFO L225 Difference]: With dead ends: 495 [2019-10-14 23:46:10,637 INFO L226 Difference]: Without dead ends: 323 [2019-10-14 23:46:10,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-14 23:46:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-10-14 23:46:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-14 23:46:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 419 transitions. [2019-10-14 23:46:10,663 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 419 transitions. Word has length 183 [2019-10-14 23:46:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:10,664 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 419 transitions. [2019-10-14 23:46:10,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 419 transitions. [2019-10-14 23:46:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-14 23:46:10,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:10,667 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:46:10,667 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1391084918, now seen corresponding path program 2 times [2019-10-14 23:46:10,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:10,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664089820] [2019-10-14 23:46:10,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:10,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-14 23:46:10,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664089820] [2019-10-14 23:46:10,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045905058] [2019-10-14 23:46:10,919 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:11,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 23:46:11,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:46:11,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:11,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-14 23:46:11,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:46:11,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-14 23:46:11,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400652425] [2019-10-14 23:46:11,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:46:11,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:46:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:11,096 INFO L87 Difference]: Start difference. First operand 319 states and 419 transitions. Second operand 4 states. [2019-10-14 23:46:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:11,145 INFO L93 Difference]: Finished difference Result 490 states and 667 transitions. [2019-10-14 23:46:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:11,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-10-14 23:46:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:11,147 INFO L225 Difference]: With dead ends: 490 [2019-10-14 23:46:11,148 INFO L226 Difference]: Without dead ends: 325 [2019-10-14 23:46:11,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-14 23:46:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2019-10-14 23:46:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-14 23:46:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2019-10-14 23:46:11,171 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 190 [2019-10-14 23:46:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:11,171 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2019-10-14 23:46:11,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:46:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2019-10-14 23:46:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-14 23:46:11,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:11,174 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:46:11,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:11,379 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 246207847, now seen corresponding path program 1 times [2019-10-14 23:46:11,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:11,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006433495] [2019-10-14 23:46:11,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:11,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:11,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-14 23:46:11,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006433495] [2019-10-14 23:46:11,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991630160] [2019-10-14 23:46:11,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:11,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-10-14 23:46:11,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:11,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-10-14 23:46:11,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958376719] [2019-10-14 23:46:11,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:46:11,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:46:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:11,922 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 7 states. [2019-10-14 23:46:12,464 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 23:46:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:13,893 INFO L93 Difference]: Finished difference Result 565 states and 760 transitions. [2019-10-14 23:46:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:46:13,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-14 23:46:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:13,902 INFO L225 Difference]: With dead ends: 565 [2019-10-14 23:46:13,902 INFO L226 Difference]: Without dead ends: 328 [2019-10-14 23:46:13,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:46:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-14 23:46:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2019-10-14 23:46:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-14 23:46:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 391 transitions. [2019-10-14 23:46:13,985 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 391 transitions. Word has length 202 [2019-10-14 23:46:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:13,986 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 391 transitions. [2019-10-14 23:46:13,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:46:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 391 transitions. [2019-10-14 23:46:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-14 23:46:13,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:13,992 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:46:14,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:14,199 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1448564390, now seen corresponding path program 1 times [2019-10-14 23:46:14,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:14,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575245007] [2019-10-14 23:46:14,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:14,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:14,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,410 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:46:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-14 23:46:14,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575245007] [2019-10-14 23:46:14,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178114558] [2019-10-14 23:46:14,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true