/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-17 22:49:56,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-17 22:49:56,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-17 22:49:56,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-17 22:49:56,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-17 22:49:56,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-17 22:49:56,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-17 22:49:56,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-17 22:49:56,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-17 22:49:56,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-17 22:49:56,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-17 22:49:56,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-17 22:49:56,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-17 22:49:56,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-17 22:49:56,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-17 22:49:56,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-17 22:49:56,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-17 22:49:56,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-17 22:49:56,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-17 22:49:56,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-17 22:49:56,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-17 22:49:56,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-17 22:49:56,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-17 22:49:56,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-17 22:49:56,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-17 22:49:56,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-17 22:49:56,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-17 22:49:56,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-17 22:49:56,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-17 22:49:56,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-17 22:49:56,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-17 22:49:56,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-17 22:49:56,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-17 22:49:56,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-17 22:49:56,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-17 22:49:56,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-17 22:49:56,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-17 22:49:56,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-17 22:49:56,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-17 22:49:56,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-17 22:49:56,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-17 22:49:56,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-04-17 22:49:56,222 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-17 22:49:56,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-17 22:49:56,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-17 22:49:56,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-17 22:49:56,228 INFO L138 SettingsManager]: * Use SBE=true [2020-04-17 22:49:56,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-17 22:49:56,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-17 22:49:56,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-17 22:49:56,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-17 22:49:56,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-17 22:49:56,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-17 22:49:56,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-17 22:49:56,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-17 22:49:56,230 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-17 22:49:56,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-17 22:49:56,231 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-17 22:49:56,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-17 22:49:56,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-17 22:49:56,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-17 22:49:56,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-17 22:49:56,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-17 22:49:56,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 22:49:56,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-17 22:49:56,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-17 22:49:56,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-17 22:49:56,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-17 22:49:56,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-17 22:49:56,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-17 22:49:56,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-17 22:49:56,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-17 22:49:56,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-17 22:49:56,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-17 22:49:56,526 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-17 22:49:56,527 INFO L275 PluginConnector]: CDTParser initialized [2020-04-17 22:49:56,527 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2020-04-17 22:49:56,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9a18474/3a5815263be74fb59e097d6184bf62b1/FLAG1120db623 [2020-04-17 22:49:57,164 INFO L306 CDTParser]: Found 1 translation units. [2020-04-17 22:49:57,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2020-04-17 22:49:57,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9a18474/3a5815263be74fb59e097d6184bf62b1/FLAG1120db623 [2020-04-17 22:49:57,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9a18474/3a5815263be74fb59e097d6184bf62b1 [2020-04-17 22:49:57,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-17 22:49:57,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-17 22:49:57,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-17 22:49:57,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-17 22:49:57,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-17 22:49:57,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:49:57" (1/1) ... [2020-04-17 22:49:57,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a10bfa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:57, skipping insertion in model container [2020-04-17 22:49:57,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 10:49:57" (1/1) ... [2020-04-17 22:49:57,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-17 22:49:57,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-17 22:49:57,727 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:49:58,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:49:58,213 INFO L203 MainTranslator]: Completed pre-run [2020-04-17 22:49:58,225 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 22:49:58,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 22:49:58,463 INFO L208 MainTranslator]: Completed translation [2020-04-17 22:49:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58 WrapperNode [2020-04-17 22:49:58,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-17 22:49:58,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-17 22:49:58,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-17 22:49:58,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-17 22:49:58,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-17 22:49:58,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-17 22:49:58,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-17 22:49:58,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-17 22:49:58,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (1/1) ... [2020-04-17 22:49:58,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-17 22:49:58,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-17 22:49:58,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-17 22:49:58,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-17 22:49:58,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (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 [2020-04-17 22:49:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-04-17 22:49:58,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-04-17 22:49:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-04-17 22:49:58,671 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-04-17 22:49:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-17 22:49:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-17 22:49:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-17 22:49:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-17 22:49:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-17 22:49:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-17 22:49:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-17 22:49:58,674 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-17 22:49:59,382 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-17 22:49:59,384 INFO L295 CfgBuilder]: Removed 22 assume(true) statements. [2020-04-17 22:49:59,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:49:59 BoogieIcfgContainer [2020-04-17 22:49:59,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-17 22:49:59,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-17 22:49:59,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-17 22:49:59,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-17 22:49:59,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.04 10:49:57" (1/3) ... [2020-04-17 22:49:59,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a70b770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:49:59, skipping insertion in model container [2020-04-17 22:49:59,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 10:49:58" (2/3) ... [2020-04-17 22:49:59,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a70b770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 10:49:59, skipping insertion in model container [2020-04-17 22:49:59,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 10:49:59" (3/3) ... [2020-04-17 22:49:59,402 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2020-04-17 22:49:59,412 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-17 22:49:59,413 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-17 22:49:59,422 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-04-17 22:49:59,423 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-17 22:49:59,487 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,488 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,489 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,491 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,492 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,492 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,492 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,496 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,496 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,500 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,500 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,501 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,501 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,501 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,501 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,504 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,504 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,504 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,505 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,505 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,506 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,507 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,508 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,509 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,509 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,509 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,510 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,510 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,510 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,511 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,512 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,512 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,512 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,512 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,512 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,513 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,513 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,513 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,514 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,514 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,514 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,514 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,514 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,515 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,515 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,515 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,516 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,516 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,517 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,517 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,517 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,517 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,518 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,518 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,518 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,519 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,519 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,520 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,520 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,526 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,526 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,526 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,527 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,527 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,527 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,527 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,527 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,528 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,528 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,528 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,528 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,528 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,529 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,530 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,530 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,530 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,530 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,530 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,531 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,532 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,532 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,532 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,532 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,532 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,533 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,536 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,536 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,536 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,536 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,536 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,537 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,538 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,538 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,538 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,542 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,542 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,543 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,543 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,544 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,545 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,545 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,545 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,550 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,551 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,551 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,552 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,552 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,552 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,553 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,554 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,554 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,554 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,554 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,554 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,555 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,555 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,555 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,555 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,555 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,556 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,556 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,557 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,557 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,557 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,557 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 22:49:59,577 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-17 22:49:59,599 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-17 22:49:59,599 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-17 22:49:59,599 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-17 22:49:59,599 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-17 22:49:59,599 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-17 22:49:59,599 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-17 22:49:59,600 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-17 22:49:59,600 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-17 22:49:59,624 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions, 400 flow [2020-04-17 22:49:59,626 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions, 400 flow [2020-04-17 22:49:59,713 INFO L129 PetriNetUnfolder]: 18/189 cut-off events. [2020-04-17 22:49:59,713 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 22:49:59,722 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2020-04-17 22:49:59,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions, 400 flow [2020-04-17 22:49:59,779 INFO L129 PetriNetUnfolder]: 18/189 cut-off events. [2020-04-17 22:49:59,779 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 22:49:59,783 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 189 events. 18/189 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2020-04-17 22:49:59,794 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 15102 [2020-04-17 22:49:59,795 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-17 22:50:00,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:00,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:00,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:00,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 22:50:03,763 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-04-17 22:50:04,315 INFO L206 etLargeBlockEncoding]: Checked pairs total: 20924 [2020-04-17 22:50:04,316 INFO L214 etLargeBlockEncoding]: Total number of compositions: 153 [2020-04-17 22:50:04,319 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 65 transitions, 152 flow [2020-04-17 22:50:04,433 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2182 states. [2020-04-17 22:50:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states. [2020-04-17 22:50:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 22:50:04,456 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:04,457 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:04,458 INFO L427 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -437483837, now seen corresponding path program 1 times [2020-04-17 22:50:04,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:04,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815262730] [2020-04-17 22:50:04,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:04,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815262730] [2020-04-17 22:50:04,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:04,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-17 22:50:04,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332229016] [2020-04-17 22:50:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-17 22:50:04,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-17 22:50:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-04-17 22:50:05,007 INFO L87 Difference]: Start difference. First operand 2182 states. Second operand 6 states. [2020-04-17 22:50:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:05,387 INFO L93 Difference]: Finished difference Result 2169 states and 6982 transitions. [2020-04-17 22:50:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 22:50:05,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-04-17 22:50:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:05,440 INFO L225 Difference]: With dead ends: 2169 [2020-04-17 22:50:05,440 INFO L226 Difference]: Without dead ends: 2053 [2020-04-17 22:50:05,442 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-04-17 22:50:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2020-04-17 22:50:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2020-04-17 22:50:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2020-04-17 22:50:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 6650 transitions. [2020-04-17 22:50:05,679 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 6650 transitions. Word has length 17 [2020-04-17 22:50:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:05,679 INFO L479 AbstractCegarLoop]: Abstraction has 2053 states and 6650 transitions. [2020-04-17 22:50:05,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-17 22:50:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 6650 transitions. [2020-04-17 22:50:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 22:50:05,685 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:05,685 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-17 22:50:05,685 INFO L427 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:05,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -357357885, now seen corresponding path program 1 times [2020-04-17 22:50:05,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:05,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219317473] [2020-04-17 22:50:05,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:05,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219317473] [2020-04-17 22:50:05,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:05,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 22:50:05,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961136426] [2020-04-17 22:50:05,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 22:50:05,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 22:50:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-17 22:50:05,891 INFO L87 Difference]: Start difference. First operand 2053 states and 6650 transitions. Second operand 7 states. [2020-04-17 22:50:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:06,455 INFO L93 Difference]: Finished difference Result 2588 states and 8385 transitions. [2020-04-17 22:50:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 22:50:06,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-17 22:50:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:06,476 INFO L225 Difference]: With dead ends: 2588 [2020-04-17 22:50:06,476 INFO L226 Difference]: Without dead ends: 2544 [2020-04-17 22:50:06,477 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-04-17 22:50:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2020-04-17 22:50:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2020-04-17 22:50:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2020-04-17 22:50:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8286 transitions. [2020-04-17 22:50:06,569 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8286 transitions. Word has length 18 [2020-04-17 22:50:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:06,569 INFO L479 AbstractCegarLoop]: Abstraction has 2544 states and 8286 transitions. [2020-04-17 22:50:06,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 22:50:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8286 transitions. [2020-04-17 22:50:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:06,575 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:06,576 INFO L425 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] [2020-04-17 22:50:06,576 INFO L427 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash -220223314, now seen corresponding path program 1 times [2020-04-17 22:50:06,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:06,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576526438] [2020-04-17 22:50:06,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:07,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576526438] [2020-04-17 22:50:07,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:07,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:07,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832192945] [2020-04-17 22:50:07,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:07,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:07,293 INFO L87 Difference]: Start difference. First operand 2544 states and 8286 transitions. Second operand 13 states. [2020-04-17 22:50:08,904 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 22:50:09,098 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:50:09,356 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2020-04-17 22:50:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:09,585 INFO L93 Difference]: Finished difference Result 3164 states and 10236 transitions. [2020-04-17 22:50:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:50:09,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:09,608 INFO L225 Difference]: With dead ends: 3164 [2020-04-17 22:50:09,609 INFO L226 Difference]: Without dead ends: 3164 [2020-04-17 22:50:09,609 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:50:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2020-04-17 22:50:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3104. [2020-04-17 22:50:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-04-17 22:50:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 10106 transitions. [2020-04-17 22:50:09,705 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 10106 transitions. Word has length 25 [2020-04-17 22:50:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:09,706 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 10106 transitions. [2020-04-17 22:50:09,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 10106 transitions. [2020-04-17 22:50:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:09,714 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:09,714 INFO L425 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] [2020-04-17 22:50:09,714 INFO L427 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1041383458, now seen corresponding path program 1 times [2020-04-17 22:50:09,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:09,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068681887] [2020-04-17 22:50:09,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:10,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068681887] [2020-04-17 22:50:10,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:10,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:10,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098871205] [2020-04-17 22:50:10,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:50:10,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:10,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:50:10,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:50:10,187 INFO L87 Difference]: Start difference. First operand 3104 states and 10106 transitions. Second operand 12 states. [2020-04-17 22:50:10,477 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2020-04-17 22:50:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:11,847 INFO L93 Difference]: Finished difference Result 3654 states and 11776 transitions. [2020-04-17 22:50:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 22:50:11,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 22:50:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:11,873 INFO L225 Difference]: With dead ends: 3654 [2020-04-17 22:50:11,873 INFO L226 Difference]: Without dead ends: 3654 [2020-04-17 22:50:11,874 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2020-04-17 22:50:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2020-04-17 22:50:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3594. [2020-04-17 22:50:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2020-04-17 22:50:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11646 transitions. [2020-04-17 22:50:11,978 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11646 transitions. Word has length 25 [2020-04-17 22:50:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:11,979 INFO L479 AbstractCegarLoop]: Abstraction has 3594 states and 11646 transitions. [2020-04-17 22:50:11,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:50:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11646 transitions. [2020-04-17 22:50:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:11,987 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:11,987 INFO L425 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] [2020-04-17 22:50:11,988 INFO L427 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 907099404, now seen corresponding path program 2 times [2020-04-17 22:50:11,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:11,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595509837] [2020-04-17 22:50:11,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:12,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595509837] [2020-04-17 22:50:12,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:12,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:12,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003190956] [2020-04-17 22:50:12,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:12,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:12,557 INFO L87 Difference]: Start difference. First operand 3594 states and 11646 transitions. Second operand 13 states. [2020-04-17 22:50:14,522 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-04-17 22:50:14,980 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:50:15,244 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2020-04-17 22:50:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:15,534 INFO L93 Difference]: Finished difference Result 5414 states and 17426 transitions. [2020-04-17 22:50:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-17 22:50:15,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:15,567 INFO L225 Difference]: With dead ends: 5414 [2020-04-17 22:50:15,568 INFO L226 Difference]: Without dead ends: 5414 [2020-04-17 22:50:15,571 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:50:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2020-04-17 22:50:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 3844. [2020-04-17 22:50:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2020-04-17 22:50:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 12546 transitions. [2020-04-17 22:50:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 12546 transitions. Word has length 25 [2020-04-17 22:50:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:15,687 INFO L479 AbstractCegarLoop]: Abstraction has 3844 states and 12546 transitions. [2020-04-17 22:50:15,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 12546 transitions. [2020-04-17 22:50:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:15,696 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:15,696 INFO L425 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] [2020-04-17 22:50:15,697 INFO L427 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 356628326, now seen corresponding path program 3 times [2020-04-17 22:50:15,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:15,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366000128] [2020-04-17 22:50:15,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:16,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366000128] [2020-04-17 22:50:16,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:16,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:16,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891716706] [2020-04-17 22:50:16,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:16,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:16,244 INFO L87 Difference]: Start difference. First operand 3844 states and 12546 transitions. Second operand 13 states. [2020-04-17 22:50:17,722 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-04-17 22:50:19,008 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2020-04-17 22:50:19,233 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2020-04-17 22:50:19,536 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-04-17 22:50:19,692 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2020-04-17 22:50:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:20,029 INFO L93 Difference]: Finished difference Result 4818 states and 15403 transitions. [2020-04-17 22:50:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-17 22:50:20,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:20,045 INFO L225 Difference]: With dead ends: 4818 [2020-04-17 22:50:20,045 INFO L226 Difference]: Without dead ends: 4818 [2020-04-17 22:50:20,046 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=304, Invalid=688, Unknown=0, NotChecked=0, Total=992 [2020-04-17 22:50:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2020-04-17 22:50:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 3188. [2020-04-17 22:50:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2020-04-17 22:50:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10243 transitions. [2020-04-17 22:50:20,140 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10243 transitions. Word has length 25 [2020-04-17 22:50:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:20,141 INFO L479 AbstractCegarLoop]: Abstraction has 3188 states and 10243 transitions. [2020-04-17 22:50:20,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10243 transitions. [2020-04-17 22:50:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:20,146 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:20,146 INFO L425 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] [2020-04-17 22:50:20,147 INFO L427 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1491389276, now seen corresponding path program 2 times [2020-04-17 22:50:20,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:20,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551939700] [2020-04-17 22:50:20,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:20,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551939700] [2020-04-17 22:50:20,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:20,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 22:50:20,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410103410] [2020-04-17 22:50:20,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:50:20,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:50:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:50:20,568 INFO L87 Difference]: Start difference. First operand 3188 states and 10243 transitions. Second operand 13 states. [2020-04-17 22:50:21,747 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-04-17 22:50:23,219 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2020-04-17 22:50:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:23,497 INFO L93 Difference]: Finished difference Result 4168 states and 13116 transitions. [2020-04-17 22:50:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 22:50:23,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 22:50:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:23,508 INFO L225 Difference]: With dead ends: 4168 [2020-04-17 22:50:23,509 INFO L226 Difference]: Without dead ends: 4168 [2020-04-17 22:50:23,509 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:50:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2020-04-17 22:50:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3188. [2020-04-17 22:50:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2020-04-17 22:50:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 10166 transitions. [2020-04-17 22:50:23,606 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 10166 transitions. Word has length 25 [2020-04-17 22:50:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:23,606 INFO L479 AbstractCegarLoop]: Abstraction has 3188 states and 10166 transitions. [2020-04-17 22:50:23,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:50:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 10166 transitions. [2020-04-17 22:50:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 22:50:23,613 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:23,613 INFO L425 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] [2020-04-17 22:50:23,613 INFO L427 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1997301412, now seen corresponding path program 3 times [2020-04-17 22:50:23,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:23,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076089624] [2020-04-17 22:50:23,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:24,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076089624] [2020-04-17 22:50:24,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:24,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:50:24,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648295060] [2020-04-17 22:50:24,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 22:50:24,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 22:50:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-04-17 22:50:24,052 INFO L87 Difference]: Start difference. First operand 3188 states and 10166 transitions. Second operand 12 states. [2020-04-17 22:50:24,692 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-04-17 22:50:25,070 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-04-17 22:50:26,207 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2020-04-17 22:50:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:26,433 INFO L93 Difference]: Finished difference Result 3972 states and 12550 transitions. [2020-04-17 22:50:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:50:26,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 22:50:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:26,445 INFO L225 Difference]: With dead ends: 3972 [2020-04-17 22:50:26,446 INFO L226 Difference]: Without dead ends: 3972 [2020-04-17 22:50:26,446 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-04-17 22:50:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-04-17 22:50:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2852. [2020-04-17 22:50:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2020-04-17 22:50:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 9100 transitions. [2020-04-17 22:50:26,527 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 9100 transitions. Word has length 25 [2020-04-17 22:50:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:26,528 INFO L479 AbstractCegarLoop]: Abstraction has 2852 states and 9100 transitions. [2020-04-17 22:50:26,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 22:50:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 9100 transitions. [2020-04-17 22:50:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:26,533 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:26,533 INFO L425 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] [2020-04-17 22:50:26,533 INFO L427 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:26,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512480, now seen corresponding path program 1 times [2020-04-17 22:50:26,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:26,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009489304] [2020-04-17 22:50:26,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:27,228 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-04-17 22:50:27,401 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2020-04-17 22:50:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:27,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009489304] [2020-04-17 22:50:27,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:27,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:27,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635754814] [2020-04-17 22:50:27,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:27,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:27,485 INFO L87 Difference]: Start difference. First operand 2852 states and 9100 transitions. Second operand 16 states. [2020-04-17 22:50:29,018 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2020-04-17 22:50:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:30,458 INFO L93 Difference]: Finished difference Result 5017 states and 16252 transitions. [2020-04-17 22:50:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:30,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:30,474 INFO L225 Difference]: With dead ends: 5017 [2020-04-17 22:50:30,474 INFO L226 Difference]: Without dead ends: 5017 [2020-04-17 22:50:30,474 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:50:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2020-04-17 22:50:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2020-04-17 22:50:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2020-04-17 22:50:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13138 transitions. [2020-04-17 22:50:30,607 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13138 transitions. Word has length 27 [2020-04-17 22:50:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:30,607 INFO L479 AbstractCegarLoop]: Abstraction has 4102 states and 13138 transitions. [2020-04-17 22:50:30,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13138 transitions. [2020-04-17 22:50:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:30,614 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:30,614 INFO L425 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] [2020-04-17 22:50:30,614 INFO L427 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2081512479, now seen corresponding path program 1 times [2020-04-17 22:50:30,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:30,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584397046] [2020-04-17 22:50:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:31,213 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-04-17 22:50:31,404 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-04-17 22:50:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:31,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584397046] [2020-04-17 22:50:31,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:31,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:31,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055613583] [2020-04-17 22:50:31,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:31,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:31,485 INFO L87 Difference]: Start difference. First operand 4102 states and 13138 transitions. Second operand 16 states. [2020-04-17 22:50:32,544 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-04-17 22:50:32,791 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:50:33,100 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2020-04-17 22:50:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:34,421 INFO L93 Difference]: Finished difference Result 5017 states and 16132 transitions. [2020-04-17 22:50:34,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:34,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:34,430 INFO L225 Difference]: With dead ends: 5017 [2020-04-17 22:50:34,430 INFO L226 Difference]: Without dead ends: 5017 [2020-04-17 22:50:34,430 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:50:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2020-04-17 22:50:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4102. [2020-04-17 22:50:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2020-04-17 22:50:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 13063 transitions. [2020-04-17 22:50:34,523 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 13063 transitions. Word has length 27 [2020-04-17 22:50:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:34,524 INFO L479 AbstractCegarLoop]: Abstraction has 4102 states and 13063 transitions. [2020-04-17 22:50:34,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 13063 transitions. [2020-04-17 22:50:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:34,530 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:34,530 INFO L425 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] [2020-04-17 22:50:34,531 INFO L427 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash 363501539, now seen corresponding path program 1 times [2020-04-17 22:50:34,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:34,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939588060] [2020-04-17 22:50:34,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:35,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939588060] [2020-04-17 22:50:35,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:35,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:50:35,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314128710] [2020-04-17 22:50:35,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:50:35,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:50:35,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:50:35,293 INFO L87 Difference]: Start difference. First operand 4102 states and 13063 transitions. Second operand 15 states. [2020-04-17 22:50:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:37,819 INFO L93 Difference]: Finished difference Result 6137 states and 19705 transitions. [2020-04-17 22:50:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:50:37,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:50:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:37,829 INFO L225 Difference]: With dead ends: 6137 [2020-04-17 22:50:37,829 INFO L226 Difference]: Without dead ends: 6137 [2020-04-17 22:50:37,829 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:50:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2020-04-17 22:50:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 4620. [2020-04-17 22:50:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2020-04-17 22:50:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 14657 transitions. [2020-04-17 22:50:37,933 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 14657 transitions. Word has length 27 [2020-04-17 22:50:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:37,933 INFO L479 AbstractCegarLoop]: Abstraction has 4620 states and 14657 transitions. [2020-04-17 22:50:37,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:50:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 14657 transitions. [2020-04-17 22:50:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:37,941 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:37,941 INFO L425 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] [2020-04-17 22:50:37,941 INFO L427 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1056139074, now seen corresponding path program 2 times [2020-04-17 22:50:37,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:37,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700712907] [2020-04-17 22:50:37,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:38,391 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-04-17 22:50:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:38,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700712907] [2020-04-17 22:50:38,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:38,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462257432] [2020-04-17 22:50:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:38,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:38,754 INFO L87 Difference]: Start difference. First operand 4620 states and 14657 transitions. Second operand 16 states. [2020-04-17 22:50:40,330 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-17 22:50:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:41,956 INFO L93 Difference]: Finished difference Result 7329 states and 23321 transitions. [2020-04-17 22:50:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:41,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:41,968 INFO L225 Difference]: With dead ends: 7329 [2020-04-17 22:50:41,968 INFO L226 Difference]: Without dead ends: 7329 [2020-04-17 22:50:41,969 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:50:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2020-04-17 22:50:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 4804. [2020-04-17 22:50:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2020-04-17 22:50:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2020-04-17 22:50:42,100 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2020-04-17 22:50:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:42,101 INFO L479 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2020-04-17 22:50:42,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2020-04-17 22:50:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:42,201 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:42,202 INFO L425 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] [2020-04-17 22:50:42,202 INFO L427 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1544227084, now seen corresponding path program 3 times [2020-04-17 22:50:42,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:42,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269312239] [2020-04-17 22:50:42,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:42,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269312239] [2020-04-17 22:50:42,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:42,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:42,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299634927] [2020-04-17 22:50:42,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:42,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:42,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:42,988 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2020-04-17 22:50:44,279 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-04-17 22:50:44,558 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-17 22:50:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:46,359 INFO L93 Difference]: Finished difference Result 6739 states and 21561 transitions. [2020-04-17 22:50:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:50:46,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:46,373 INFO L225 Difference]: With dead ends: 6739 [2020-04-17 22:50:46,373 INFO L226 Difference]: Without dead ends: 6739 [2020-04-17 22:50:46,373 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:50:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2020-04-17 22:50:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 4804. [2020-04-17 22:50:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2020-04-17 22:50:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2020-04-17 22:50:46,607 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2020-04-17 22:50:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:46,607 INFO L479 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2020-04-17 22:50:46,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2020-04-17 22:50:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:46,616 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:46,616 INFO L425 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] [2020-04-17 22:50:46,616 INFO L427 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 796249174, now seen corresponding path program 4 times [2020-04-17 22:50:46,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:46,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920740689] [2020-04-17 22:50:46,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:47,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920740689] [2020-04-17 22:50:47,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:47,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:47,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637338722] [2020-04-17 22:50:47,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:47,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:47,386 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2020-04-17 22:50:48,664 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-04-17 22:50:49,041 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2020-04-17 22:50:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:50,825 INFO L93 Difference]: Finished difference Result 6619 states and 21321 transitions. [2020-04-17 22:50:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:50:50,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:50,836 INFO L225 Difference]: With dead ends: 6619 [2020-04-17 22:50:50,836 INFO L226 Difference]: Without dead ends: 6619 [2020-04-17 22:50:50,836 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:50:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2020-04-17 22:50:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 5634. [2020-04-17 22:50:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5634 states. [2020-04-17 22:50:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 17987 transitions. [2020-04-17 22:50:51,018 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 17987 transitions. Word has length 27 [2020-04-17 22:50:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:51,018 INFO L479 AbstractCegarLoop]: Abstraction has 5634 states and 17987 transitions. [2020-04-17 22:50:51,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 17987 transitions. [2020-04-17 22:50:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:51,028 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:51,028 INFO L425 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] [2020-04-17 22:50:51,028 INFO L427 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash 796249175, now seen corresponding path program 2 times [2020-04-17 22:50:51,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:51,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163001030] [2020-04-17 22:50:51,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:51,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163001030] [2020-04-17 22:50:51,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:51,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:51,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299563303] [2020-04-17 22:50:51,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:51,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:51,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:51,832 INFO L87 Difference]: Start difference. First operand 5634 states and 17987 transitions. Second operand 16 states. [2020-04-17 22:50:53,027 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-04-17 22:50:53,376 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-17 22:50:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:55,073 INFO L93 Difference]: Finished difference Result 6619 states and 21201 transitions. [2020-04-17 22:50:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:50:55,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:55,084 INFO L225 Difference]: With dead ends: 6619 [2020-04-17 22:50:55,084 INFO L226 Difference]: Without dead ends: 6619 [2020-04-17 22:50:55,085 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:50:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2020-04-17 22:50:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 4804. [2020-04-17 22:50:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2020-04-17 22:50:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 15209 transitions. [2020-04-17 22:50:55,190 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 15209 transitions. Word has length 27 [2020-04-17 22:50:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:55,190 INFO L479 AbstractCegarLoop]: Abstraction has 4804 states and 15209 transitions. [2020-04-17 22:50:55,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 15209 transitions. [2020-04-17 22:50:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:55,198 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:55,198 INFO L425 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] [2020-04-17 22:50:55,199 INFO L427 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash 471322490, now seen corresponding path program 5 times [2020-04-17 22:50:55,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:55,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522201310] [2020-04-17 22:50:55,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:50:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:50:55,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522201310] [2020-04-17 22:50:55,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:50:55,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:50:55,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567791379] [2020-04-17 22:50:55,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:50:55,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:50:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:50:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:50:55,925 INFO L87 Difference]: Start difference. First operand 4804 states and 15209 transitions. Second operand 16 states. [2020-04-17 22:50:57,146 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-17 22:50:57,522 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2020-04-17 22:50:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:50:59,581 INFO L93 Difference]: Finished difference Result 8562 states and 27805 transitions. [2020-04-17 22:50:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:50:59,582 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:50:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:50:59,595 INFO L225 Difference]: With dead ends: 8562 [2020-04-17 22:50:59,595 INFO L226 Difference]: Without dead ends: 8562 [2020-04-17 22:50:59,596 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:50:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2020-04-17 22:50:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 5539. [2020-04-17 22:50:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2020-04-17 22:50:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 17692 transitions. [2020-04-17 22:50:59,712 INFO L78 Accepts]: Start accepts. Automaton has 5539 states and 17692 transitions. Word has length 27 [2020-04-17 22:50:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:50:59,712 INFO L479 AbstractCegarLoop]: Abstraction has 5539 states and 17692 transitions. [2020-04-17 22:50:59,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:50:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5539 states and 17692 transitions. [2020-04-17 22:50:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:50:59,719 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:50:59,719 INFO L425 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] [2020-04-17 22:50:59,719 INFO L427 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:50:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:50:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 471322491, now seen corresponding path program 3 times [2020-04-17 22:50:59,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:50:59,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044232761] [2020-04-17 22:50:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:50:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:00,218 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-04-17 22:51:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:00,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044232761] [2020-04-17 22:51:00,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:00,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:00,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42719586] [2020-04-17 22:51:00,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:00,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:00,452 INFO L87 Difference]: Start difference. First operand 5539 states and 17692 transitions. Second operand 16 states. [2020-04-17 22:51:01,726 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-04-17 22:51:02,121 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2020-04-17 22:51:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:04,186 INFO L93 Difference]: Finished difference Result 8562 states and 27685 transitions. [2020-04-17 22:51:04,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:51:04,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:04,200 INFO L225 Difference]: With dead ends: 8562 [2020-04-17 22:51:04,200 INFO L226 Difference]: Without dead ends: 8562 [2020-04-17 22:51:04,201 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-17 22:51:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2020-04-17 22:51:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 4849. [2020-04-17 22:51:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2020-04-17 22:51:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2020-04-17 22:51:04,286 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2020-04-17 22:51:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:04,286 INFO L479 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2020-04-17 22:51:04,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2020-04-17 22:51:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:04,292 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:04,292 INFO L425 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] [2020-04-17 22:51:04,292 INFO L427 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash -869839874, now seen corresponding path program 6 times [2020-04-17 22:51:04,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:04,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535710837] [2020-04-17 22:51:04,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:04,693 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-04-17 22:51:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:05,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535710837] [2020-04-17 22:51:05,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:05,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:05,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087650999] [2020-04-17 22:51:05,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:05,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:05,105 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2020-04-17 22:51:05,948 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2020-04-17 22:51:06,541 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-04-17 22:51:06,807 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-04-17 22:51:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:08,305 INFO L93 Difference]: Finished difference Result 7194 states and 22926 transitions. [2020-04-17 22:51:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:51:08,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:08,316 INFO L225 Difference]: With dead ends: 7194 [2020-04-17 22:51:08,317 INFO L226 Difference]: Without dead ends: 7194 [2020-04-17 22:51:08,317 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2020-04-17 22:51:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2020-04-17 22:51:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 4849. [2020-04-17 22:51:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2020-04-17 22:51:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 15354 transitions. [2020-04-17 22:51:08,397 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 15354 transitions. Word has length 27 [2020-04-17 22:51:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:08,397 INFO L479 AbstractCegarLoop]: Abstraction has 4849 states and 15354 transitions. [2020-04-17 22:51:08,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 15354 transitions. [2020-04-17 22:51:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:08,403 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:08,403 INFO L425 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] [2020-04-17 22:51:08,403 INFO L427 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360997, now seen corresponding path program 2 times [2020-04-17 22:51:08,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:08,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887306384] [2020-04-17 22:51:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:09,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887306384] [2020-04-17 22:51:09,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:09,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:09,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59631188] [2020-04-17 22:51:09,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:09,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:09,097 INFO L87 Difference]: Start difference. First operand 4849 states and 15354 transitions. Second operand 16 states. [2020-04-17 22:51:09,709 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-04-17 22:51:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:11,855 INFO L93 Difference]: Finished difference Result 7103 states and 22712 transitions. [2020-04-17 22:51:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:11,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:11,866 INFO L225 Difference]: With dead ends: 7103 [2020-04-17 22:51:11,866 INFO L226 Difference]: Without dead ends: 7103 [2020-04-17 22:51:11,866 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7103 states. [2020-04-17 22:51:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7103 to 6003. [2020-04-17 22:51:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2020-04-17 22:51:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 19104 transitions. [2020-04-17 22:51:11,953 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 19104 transitions. Word has length 27 [2020-04-17 22:51:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:11,953 INFO L479 AbstractCegarLoop]: Abstraction has 6003 states and 19104 transitions. [2020-04-17 22:51:11,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 19104 transitions. [2020-04-17 22:51:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:11,960 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:11,960 INFO L425 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] [2020-04-17 22:51:11,960 INFO L427 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1615360998, now seen corresponding path program 1 times [2020-04-17 22:51:11,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:11,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505845180] [2020-04-17 22:51:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:12,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505845180] [2020-04-17 22:51:12,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:12,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077369492] [2020-04-17 22:51:12,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:12,767 INFO L87 Difference]: Start difference. First operand 6003 states and 19104 transitions. Second operand 16 states. [2020-04-17 22:51:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:16,251 INFO L93 Difference]: Finished difference Result 7028 states and 22428 transitions. [2020-04-17 22:51:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:16,251 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:16,261 INFO L225 Difference]: With dead ends: 7028 [2020-04-17 22:51:16,261 INFO L226 Difference]: Without dead ends: 7028 [2020-04-17 22:51:16,262 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2020-04-17 22:51:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4733. [2020-04-17 22:51:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2020-04-17 22:51:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2020-04-17 22:51:16,332 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2020-04-17 22:51:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:16,332 INFO L479 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2020-04-17 22:51:16,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2020-04-17 22:51:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:16,338 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:16,338 INFO L425 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] [2020-04-17 22:51:16,338 INFO L427 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash -122346011, now seen corresponding path program 3 times [2020-04-17 22:51:16,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:16,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278520417] [2020-04-17 22:51:16,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:17,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278520417] [2020-04-17 22:51:17,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:17,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279986658] [2020-04-17 22:51:17,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:17,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:17,042 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2020-04-17 22:51:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:19,644 INFO L93 Difference]: Finished difference Result 6548 states and 20998 transitions. [2020-04-17 22:51:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:51:19,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:51:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:19,654 INFO L225 Difference]: With dead ends: 6548 [2020-04-17 22:51:19,654 INFO L226 Difference]: Without dead ends: 6548 [2020-04-17 22:51:19,654 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:51:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2020-04-17 22:51:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 4733. [2020-04-17 22:51:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4733 states. [2020-04-17 22:51:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 15006 transitions. [2020-04-17 22:51:19,727 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 15006 transitions. Word has length 27 [2020-04-17 22:51:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:19,728 INFO L479 AbstractCegarLoop]: Abstraction has 4733 states and 15006 transitions. [2020-04-17 22:51:19,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 15006 transitions. [2020-04-17 22:51:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:19,735 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:19,735 INFO L425 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] [2020-04-17 22:51:19,735 INFO L427 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1197665119, now seen corresponding path program 4 times [2020-04-17 22:51:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:19,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537184423] [2020-04-17 22:51:19,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:20,175 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2020-04-17 22:51:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:20,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537184423] [2020-04-17 22:51:20,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:20,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:20,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854976631] [2020-04-17 22:51:20,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:20,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:20,389 INFO L87 Difference]: Start difference. First operand 4733 states and 15006 transitions. Second operand 15 states. [2020-04-17 22:51:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:23,324 INFO L93 Difference]: Finished difference Result 8491 states and 27482 transitions. [2020-04-17 22:51:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:51:23,325 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:51:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:23,338 INFO L225 Difference]: With dead ends: 8491 [2020-04-17 22:51:23,338 INFO L226 Difference]: Without dead ends: 8491 [2020-04-17 22:51:23,339 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2020-04-17 22:51:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 4739. [2020-04-17 22:51:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2020-04-17 22:51:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2020-04-17 22:51:23,427 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2020-04-17 22:51:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:23,427 INFO L479 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2020-04-17 22:51:23,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2020-04-17 22:51:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:23,431 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:23,431 INFO L425 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] [2020-04-17 22:51:23,432 INFO L427 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 14057405, now seen corresponding path program 5 times [2020-04-17 22:51:23,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:23,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689222830] [2020-04-17 22:51:23,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:24,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689222830] [2020-04-17 22:51:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:24,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721509100] [2020-04-17 22:51:24,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:24,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:24,069 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2020-04-17 22:51:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:26,779 INFO L93 Difference]: Finished difference Result 6594 states and 21127 transitions. [2020-04-17 22:51:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:51:26,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:51:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:26,790 INFO L225 Difference]: With dead ends: 6594 [2020-04-17 22:51:26,790 INFO L226 Difference]: Without dead ends: 6594 [2020-04-17 22:51:26,791 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:51:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2020-04-17 22:51:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4739. [2020-04-17 22:51:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2020-04-17 22:51:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 15025 transitions. [2020-04-17 22:51:26,869 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 15025 transitions. Word has length 27 [2020-04-17 22:51:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:26,869 INFO L479 AbstractCegarLoop]: Abstraction has 4739 states and 15025 transitions. [2020-04-17 22:51:26,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 15025 transitions. [2020-04-17 22:51:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:26,875 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:26,875 INFO L425 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] [2020-04-17 22:51:26,875 INFO L427 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1226775101, now seen corresponding path program 6 times [2020-04-17 22:51:26,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:26,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249216878] [2020-04-17 22:51:26,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:27,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249216878] [2020-04-17 22:51:27,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:27,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 22:51:27,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558043050] [2020-04-17 22:51:27,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 22:51:27,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 22:51:27,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-04-17 22:51:27,496 INFO L87 Difference]: Start difference. First operand 4739 states and 15025 transitions. Second operand 15 states. [2020-04-17 22:51:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:30,076 INFO L93 Difference]: Finished difference Result 6784 states and 21677 transitions. [2020-04-17 22:51:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 22:51:30,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 22:51:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:30,087 INFO L225 Difference]: With dead ends: 6784 [2020-04-17 22:51:30,087 INFO L226 Difference]: Without dead ends: 6784 [2020-04-17 22:51:30,088 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2020-04-17 22:51:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2020-04-17 22:51:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 4049. [2020-04-17 22:51:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2020-04-17 22:51:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 12935 transitions. [2020-04-17 22:51:30,154 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 12935 transitions. Word has length 27 [2020-04-17 22:51:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:30,155 INFO L479 AbstractCegarLoop]: Abstraction has 4049 states and 12935 transitions. [2020-04-17 22:51:30,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 22:51:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 12935 transitions. [2020-04-17 22:51:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 22:51:30,159 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:30,159 INFO L425 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] [2020-04-17 22:51:30,160 INFO L427 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2094907358, now seen corresponding path program 7 times [2020-04-17 22:51:30,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:30,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045780259] [2020-04-17 22:51:30,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:30,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045780259] [2020-04-17 22:51:30,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:30,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 22:51:30,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111283055] [2020-04-17 22:51:30,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 22:51:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 22:51:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 22:51:30,868 INFO L87 Difference]: Start difference. First operand 4049 states and 12935 transitions. Second operand 16 states. [2020-04-17 22:51:32,283 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2020-04-17 22:51:32,578 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-04-17 22:51:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:34,247 INFO L93 Difference]: Finished difference Result 5954 states and 19167 transitions. [2020-04-17 22:51:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 22:51:34,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 22:51:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:34,257 INFO L225 Difference]: With dead ends: 5954 [2020-04-17 22:51:34,257 INFO L226 Difference]: Without dead ends: 5954 [2020-04-17 22:51:34,257 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 22:51:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-04-17 22:51:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3549. [2020-04-17 22:51:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2020-04-17 22:51:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 11415 transitions. [2020-04-17 22:51:34,317 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 11415 transitions. Word has length 27 [2020-04-17 22:51:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:34,317 INFO L479 AbstractCegarLoop]: Abstraction has 3549 states and 11415 transitions. [2020-04-17 22:51:34,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 22:51:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 11415 transitions. [2020-04-17 22:51:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:34,321 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:34,322 INFO L425 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] [2020-04-17 22:51:34,322 INFO L427 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:34,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash 399516870, now seen corresponding path program 1 times [2020-04-17 22:51:34,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:34,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523650277] [2020-04-17 22:51:34,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:35,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523650277] [2020-04-17 22:51:35,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:35,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:51:35,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366396450] [2020-04-17 22:51:35,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-04-17 22:51:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-04-17 22:51:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2020-04-17 22:51:35,401 INFO L87 Difference]: Start difference. First operand 3549 states and 11415 transitions. Second operand 20 states. [2020-04-17 22:51:35,960 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2020-04-17 22:51:36,238 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2020-04-17 22:51:36,525 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2020-04-17 22:51:37,072 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2020-04-17 22:51:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:40,084 INFO L93 Difference]: Finished difference Result 7420 states and 24247 transitions. [2020-04-17 22:51:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:51:40,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-04-17 22:51:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:40,099 INFO L225 Difference]: With dead ends: 7420 [2020-04-17 22:51:40,099 INFO L226 Difference]: Without dead ends: 7420 [2020-04-17 22:51:40,100 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:51:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2020-04-17 22:51:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 4814. [2020-04-17 22:51:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-04-17 22:51:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 15490 transitions. [2020-04-17 22:51:40,188 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 15490 transitions. Word has length 30 [2020-04-17 22:51:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:40,188 INFO L479 AbstractCegarLoop]: Abstraction has 4814 states and 15490 transitions. [2020-04-17 22:51:40,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-04-17 22:51:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 15490 transitions. [2020-04-17 22:51:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:40,193 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:40,193 INFO L425 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] [2020-04-17 22:51:40,194 INFO L427 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1461784035, now seen corresponding path program 1 times [2020-04-17 22:51:40,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:40,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373436944] [2020-04-17 22:51:40,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:40,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373436944] [2020-04-17 22:51:40,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:40,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:51:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103108988] [2020-04-17 22:51:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:51:40,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:40,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:51:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:51:40,531 INFO L87 Difference]: Start difference. First operand 4814 states and 15490 transitions. Second operand 13 states. [2020-04-17 22:51:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:42,069 INFO L93 Difference]: Finished difference Result 11335 states and 36706 transitions. [2020-04-17 22:51:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 22:51:42,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-04-17 22:51:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:42,088 INFO L225 Difference]: With dead ends: 11335 [2020-04-17 22:51:42,088 INFO L226 Difference]: Without dead ends: 11335 [2020-04-17 22:51:42,089 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-04-17 22:51:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2020-04-17 22:51:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 8356. [2020-04-17 22:51:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2020-04-17 22:51:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 27624 transitions. [2020-04-17 22:51:42,225 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 27624 transitions. Word has length 30 [2020-04-17 22:51:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:42,225 INFO L479 AbstractCegarLoop]: Abstraction has 8356 states and 27624 transitions. [2020-04-17 22:51:42,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:51:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 27624 transitions. [2020-04-17 22:51:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:42,233 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:42,233 INFO L425 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] [2020-04-17 22:51:42,233 INFO L427 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1491245864, now seen corresponding path program 2 times [2020-04-17 22:51:42,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:42,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069299995] [2020-04-17 22:51:42,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:42,457 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-04-17 22:51:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:42,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069299995] [2020-04-17 22:51:42,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:42,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:51:42,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410569247] [2020-04-17 22:51:42,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:51:42,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:42,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:51:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:51:42,885 INFO L87 Difference]: Start difference. First operand 8356 states and 27624 transitions. Second operand 17 states. [2020-04-17 22:51:44,591 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-04-17 22:51:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:46,055 INFO L93 Difference]: Finished difference Result 13039 states and 42934 transitions. [2020-04-17 22:51:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 22:51:46,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2020-04-17 22:51:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:46,079 INFO L225 Difference]: With dead ends: 13039 [2020-04-17 22:51:46,079 INFO L226 Difference]: Without dead ends: 13039 [2020-04-17 22:51:46,079 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:51:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13039 states. [2020-04-17 22:51:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13039 to 8606. [2020-04-17 22:51:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8606 states. [2020-04-17 22:51:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 28374 transitions. [2020-04-17 22:51:46,224 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 28374 transitions. Word has length 30 [2020-04-17 22:51:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:46,224 INFO L479 AbstractCegarLoop]: Abstraction has 8606 states and 28374 transitions. [2020-04-17 22:51:46,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:51:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 28374 transitions. [2020-04-17 22:51:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:46,233 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:46,233 INFO L425 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] [2020-04-17 22:51:46,233 INFO L427 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -674363086, now seen corresponding path program 3 times [2020-04-17 22:51:46,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:46,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908477375] [2020-04-17 22:51:46,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:46,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908477375] [2020-04-17 22:51:46,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:46,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 22:51:46,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817155561] [2020-04-17 22:51:46,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 22:51:46,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 22:51:46,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-04-17 22:51:46,544 INFO L87 Difference]: Start difference. First operand 8606 states and 28374 transitions. Second operand 13 states. [2020-04-17 22:51:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:49,022 INFO L93 Difference]: Finished difference Result 17441 states and 57280 transitions. [2020-04-17 22:51:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:51:49,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-04-17 22:51:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:49,049 INFO L225 Difference]: With dead ends: 17441 [2020-04-17 22:51:49,049 INFO L226 Difference]: Without dead ends: 17441 [2020-04-17 22:51:49,050 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:51:49,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2020-04-17 22:51:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 11506. [2020-04-17 22:51:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11506 states. [2020-04-17 22:51:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11506 states to 11506 states and 38701 transitions. [2020-04-17 22:51:49,233 INFO L78 Accepts]: Start accepts. Automaton has 11506 states and 38701 transitions. Word has length 30 [2020-04-17 22:51:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:49,233 INFO L479 AbstractCegarLoop]: Abstraction has 11506 states and 38701 transitions. [2020-04-17 22:51:49,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 22:51:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11506 states and 38701 transitions. [2020-04-17 22:51:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:49,244 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:49,244 INFO L425 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] [2020-04-17 22:51:49,245 INFO L427 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1889101151, now seen corresponding path program 2 times [2020-04-17 22:51:49,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:49,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808617264] [2020-04-17 22:51:49,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:50,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808617264] [2020-04-17 22:51:50,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:50,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 22:51:50,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499454815] [2020-04-17 22:51:50,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:51:50,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:51:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:51:50,024 INFO L87 Difference]: Start difference. First operand 11506 states and 38701 transitions. Second operand 19 states. [2020-04-17 22:51:50,756 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-04-17 22:51:50,896 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2020-04-17 22:51:51,119 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-04-17 22:51:51,287 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2020-04-17 22:51:51,731 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2020-04-17 22:51:52,328 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-04-17 22:51:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:51:54,377 INFO L93 Difference]: Finished difference Result 16383 states and 54578 transitions. [2020-04-17 22:51:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-17 22:51:54,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-04-17 22:51:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:51:54,403 INFO L225 Difference]: With dead ends: 16383 [2020-04-17 22:51:54,404 INFO L226 Difference]: Without dead ends: 16383 [2020-04-17 22:51:54,404 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:51:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16383 states. [2020-04-17 22:51:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16383 to 12246. [2020-04-17 22:51:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12246 states. [2020-04-17 22:51:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 40941 transitions. [2020-04-17 22:51:54,593 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 40941 transitions. Word has length 30 [2020-04-17 22:51:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:51:54,593 INFO L479 AbstractCegarLoop]: Abstraction has 12246 states and 40941 transitions. [2020-04-17 22:51:54,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:51:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 40941 transitions. [2020-04-17 22:51:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:51:54,608 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:51:54,608 INFO L425 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] [2020-04-17 22:51:54,608 INFO L427 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:51:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:51:54,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1617209505, now seen corresponding path program 3 times [2020-04-17 22:51:54,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:51:54,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607804897] [2020-04-17 22:51:54,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:51:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:51:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:51:55,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607804897] [2020-04-17 22:51:55,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:51:55,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 22:51:55,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441291125] [2020-04-17 22:51:55,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:51:55,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:51:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:51:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:51:55,411 INFO L87 Difference]: Start difference. First operand 12246 states and 40941 transitions. Second operand 18 states. [2020-04-17 22:51:56,198 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2020-04-17 22:51:56,337 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2020-04-17 22:51:56,577 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-04-17 22:51:56,741 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-04-17 22:51:57,299 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-04-17 22:51:57,499 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-04-17 22:51:58,198 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2020-04-17 22:52:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:00,563 INFO L93 Difference]: Finished difference Result 17611 states and 58807 transitions. [2020-04-17 22:52:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 22:52:00,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2020-04-17 22:52:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:00,590 INFO L225 Difference]: With dead ends: 17611 [2020-04-17 22:52:00,590 INFO L226 Difference]: Without dead ends: 17611 [2020-04-17 22:52:00,591 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2020-04-17 22:52:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17611 states. [2020-04-17 22:52:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17611 to 12246. [2020-04-17 22:52:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12246 states. [2020-04-17 22:52:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 40941 transitions. [2020-04-17 22:52:00,790 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 40941 transitions. Word has length 30 [2020-04-17 22:52:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:00,790 INFO L479 AbstractCegarLoop]: Abstraction has 12246 states and 40941 transitions. [2020-04-17 22:52:00,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:52:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 40941 transitions. [2020-04-17 22:52:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:52:00,807 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:00,808 INFO L425 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] [2020-04-17 22:52:00,808 INFO L427 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2122653751, now seen corresponding path program 4 times [2020-04-17 22:52:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:00,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175017530] [2020-04-17 22:52:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:01,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175017530] [2020-04-17 22:52:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:01,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:01,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270195616] [2020-04-17 22:52:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:01,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:01,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:01,361 INFO L87 Difference]: Start difference. First operand 12246 states and 40941 transitions. Second operand 17 states. [2020-04-17 22:52:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:05,808 INFO L93 Difference]: Finished difference Result 17258 states and 57483 transitions. [2020-04-17 22:52:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-04-17 22:52:05,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2020-04-17 22:52:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:05,836 INFO L225 Difference]: With dead ends: 17258 [2020-04-17 22:52:05,836 INFO L226 Difference]: Without dead ends: 17258 [2020-04-17 22:52:05,836 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 22:52:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2020-04-17 22:52:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 12246. [2020-04-17 22:52:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12246 states. [2020-04-17 22:52:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 40941 transitions. [2020-04-17 22:52:06,022 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 40941 transitions. Word has length 30 [2020-04-17 22:52:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:06,022 INFO L479 AbstractCegarLoop]: Abstraction has 12246 states and 40941 transitions. [2020-04-17 22:52:06,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 40941 transitions. [2020-04-17 22:52:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:52:06,032 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:06,033 INFO L425 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] [2020-04-17 22:52:06,033 INFO L427 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -980323325, now seen corresponding path program 5 times [2020-04-17 22:52:06,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:06,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972752192] [2020-04-17 22:52:06,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:06,532 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-04-17 22:52:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:06,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972752192] [2020-04-17 22:52:06,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:06,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 22:52:06,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66958579] [2020-04-17 22:52:06,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:52:06,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:52:06,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:52:06,991 INFO L87 Difference]: Start difference. First operand 12246 states and 40941 transitions. Second operand 18 states. [2020-04-17 22:52:07,662 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-04-17 22:52:07,890 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-04-17 22:52:08,324 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2020-04-17 22:52:08,832 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-04-17 22:52:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:10,926 INFO L93 Difference]: Finished difference Result 16231 states and 54137 transitions. [2020-04-17 22:52:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:10,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2020-04-17 22:52:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:10,955 INFO L225 Difference]: With dead ends: 16231 [2020-04-17 22:52:10,955 INFO L226 Difference]: Without dead ends: 16231 [2020-04-17 22:52:10,956 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2020-04-17 22:52:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16231 states. [2020-04-17 22:52:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16231 to 11434. [2020-04-17 22:52:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11434 states. [2020-04-17 22:52:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11434 states to 11434 states and 38467 transitions. [2020-04-17 22:52:12,054 INFO L78 Accepts]: Start accepts. Automaton has 11434 states and 38467 transitions. Word has length 30 [2020-04-17 22:52:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:12,055 INFO L479 AbstractCegarLoop]: Abstraction has 11434 states and 38467 transitions. [2020-04-17 22:52:12,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:52:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 11434 states and 38467 transitions. [2020-04-17 22:52:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 22:52:12,066 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:12,066 INFO L425 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] [2020-04-17 22:52:12,066 INFO L427 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 784664900, now seen corresponding path program 4 times [2020-04-17 22:52:12,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:12,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223423666] [2020-04-17 22:52:12,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:12,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223423666] [2020-04-17 22:52:12,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:12,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 22:52:12,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734325049] [2020-04-17 22:52:12,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 22:52:12,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 22:52:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-04-17 22:52:12,579 INFO L87 Difference]: Start difference. First operand 11434 states and 38467 transitions. Second operand 17 states. [2020-04-17 22:52:13,445 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-04-17 22:52:13,799 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2020-04-17 22:52:14,266 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-04-17 22:52:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:15,824 INFO L93 Difference]: Finished difference Result 15251 states and 51012 transitions. [2020-04-17 22:52:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 22:52:15,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2020-04-17 22:52:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:15,849 INFO L225 Difference]: With dead ends: 15251 [2020-04-17 22:52:15,849 INFO L226 Difference]: Without dead ends: 15251 [2020-04-17 22:52:15,850 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2020-04-17 22:52:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15251 states. [2020-04-17 22:52:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15251 to 10144. [2020-04-17 22:52:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10144 states. [2020-04-17 22:52:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10144 states to 10144 states and 34412 transitions. [2020-04-17 22:52:16,017 INFO L78 Accepts]: Start accepts. Automaton has 10144 states and 34412 transitions. Word has length 30 [2020-04-17 22:52:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:16,017 INFO L479 AbstractCegarLoop]: Abstraction has 10144 states and 34412 transitions. [2020-04-17 22:52:16,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 22:52:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10144 states and 34412 transitions. [2020-04-17 22:52:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:52:16,027 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:16,027 INFO L425 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] [2020-04-17 22:52:16,027 INFO L427 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -838148739, now seen corresponding path program 1 times [2020-04-17 22:52:16,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:16,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946661988] [2020-04-17 22:52:16,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:16,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946661988] [2020-04-17 22:52:16,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:16,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 22:52:16,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505312359] [2020-04-17 22:52:16,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:52:16,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:52:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:52:16,872 INFO L87 Difference]: Start difference. First operand 10144 states and 34412 transitions. Second operand 18 states. [2020-04-17 22:52:17,585 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2020-04-17 22:52:17,841 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-04-17 22:52:18,185 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-04-17 22:52:18,356 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2020-04-17 22:52:18,503 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2020-04-17 22:52:18,814 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2020-04-17 22:52:18,989 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-04-17 22:52:19,155 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-04-17 22:52:19,424 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-04-17 22:52:19,604 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2020-04-17 22:52:19,782 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2020-04-17 22:52:20,210 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-04-17 22:52:20,418 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2020-04-17 22:52:20,859 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-04-17 22:52:21,075 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2020-04-17 22:52:21,946 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2020-04-17 22:52:22,203 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-04-17 22:52:22,356 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2020-04-17 22:52:22,666 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2020-04-17 22:52:22,851 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2020-04-17 22:52:23,028 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2020-04-17 22:52:23,301 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2020-04-17 22:52:23,538 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2020-04-17 22:52:23,745 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2020-04-17 22:52:24,185 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-04-17 22:52:24,430 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2020-04-17 22:52:24,632 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-04-17 22:52:24,867 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2020-04-17 22:52:25,140 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 65 [2020-04-17 22:52:25,381 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2020-04-17 22:52:25,681 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2020-04-17 22:52:25,978 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2020-04-17 22:52:26,316 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2020-04-17 22:52:26,618 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2020-04-17 22:52:27,087 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2020-04-17 22:52:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:27,339 INFO L93 Difference]: Finished difference Result 11134 states and 37402 transitions. [2020-04-17 22:52:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-04-17 22:52:27,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-04-17 22:52:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:27,359 INFO L225 Difference]: With dead ends: 11134 [2020-04-17 22:52:27,359 INFO L226 Difference]: Without dead ends: 11134 [2020-04-17 22:52:27,360 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1092, Invalid=2690, Unknown=0, NotChecked=0, Total=3782 [2020-04-17 22:52:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2020-04-17 22:52:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10714. [2020-04-17 22:52:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10714 states. [2020-04-17 22:52:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10714 states to 10714 states and 36122 transitions. [2020-04-17 22:52:27,521 INFO L78 Accepts]: Start accepts. Automaton has 10714 states and 36122 transitions. Word has length 31 [2020-04-17 22:52:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:27,521 INFO L479 AbstractCegarLoop]: Abstraction has 10714 states and 36122 transitions. [2020-04-17 22:52:27,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:52:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10714 states and 36122 transitions. [2020-04-17 22:52:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:52:27,533 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:27,534 INFO L425 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] [2020-04-17 22:52:27,534 INFO L427 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1965024921, now seen corresponding path program 2 times [2020-04-17 22:52:27,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:27,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334080937] [2020-04-17 22:52:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:28,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334080937] [2020-04-17 22:52:28,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:28,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:52:28,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98852077] [2020-04-17 22:52:28,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:52:28,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:52:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:52:28,470 INFO L87 Difference]: Start difference. First operand 10714 states and 36122 transitions. Second operand 19 states. [2020-04-17 22:52:29,490 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2020-04-17 22:52:29,737 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-04-17 22:52:30,274 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-04-17 22:52:30,449 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-04-17 22:52:30,607 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:52:30,987 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-04-17 22:52:31,172 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2020-04-17 22:52:31,333 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-04-17 22:52:31,655 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-04-17 22:52:31,868 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-04-17 22:52:32,058 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2020-04-17 22:52:32,566 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-04-17 22:52:32,792 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2020-04-17 22:52:33,291 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-04-17 22:52:33,506 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-04-17 22:52:34,562 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2020-04-17 22:52:34,829 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2020-04-17 22:52:34,991 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:52:35,180 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2020-04-17 22:52:35,498 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-04-17 22:52:35,704 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2020-04-17 22:52:35,881 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-04-17 22:52:36,065 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 22:52:36,330 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2020-04-17 22:52:36,650 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2020-04-17 22:52:36,862 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2020-04-17 22:52:37,246 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2020-04-17 22:52:37,529 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2020-04-17 22:52:37,746 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2020-04-17 22:52:37,989 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2020-04-17 22:52:38,288 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2020-04-17 22:52:38,547 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2020-04-17 22:52:38,875 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2020-04-17 22:52:39,193 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2020-04-17 22:52:39,539 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2020-04-17 22:52:39,864 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2020-04-17 22:52:40,349 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2020-04-17 22:52:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:40,628 INFO L93 Difference]: Finished difference Result 11324 states and 37952 transitions. [2020-04-17 22:52:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-04-17 22:52:40,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-04-17 22:52:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:40,650 INFO L225 Difference]: With dead ends: 11324 [2020-04-17 22:52:40,650 INFO L226 Difference]: Without dead ends: 11324 [2020-04-17 22:52:40,651 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1274, Invalid=3418, Unknown=0, NotChecked=0, Total=4692 [2020-04-17 22:52:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2020-04-17 22:52:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 10754. [2020-04-17 22:52:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10754 states. [2020-04-17 22:52:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10754 states to 10754 states and 36242 transitions. [2020-04-17 22:52:40,825 INFO L78 Accepts]: Start accepts. Automaton has 10754 states and 36242 transitions. Word has length 31 [2020-04-17 22:52:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:40,826 INFO L479 AbstractCegarLoop]: Abstraction has 10754 states and 36242 transitions. [2020-04-17 22:52:40,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:52:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 10754 states and 36242 transitions. [2020-04-17 22:52:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:52:40,838 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:40,838 INFO L425 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] [2020-04-17 22:52:40,838 INFO L427 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash 288220857, now seen corresponding path program 3 times [2020-04-17 22:52:40,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:40,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495755599] [2020-04-17 22:52:40,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:41,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495755599] [2020-04-17 22:52:41,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:41,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 22:52:41,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360069222] [2020-04-17 22:52:41,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 22:52:41,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 22:52:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2020-04-17 22:52:41,615 INFO L87 Difference]: Start difference. First operand 10754 states and 36242 transitions. Second operand 18 states. [2020-04-17 22:52:42,595 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-04-17 22:52:42,740 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-04-17 22:52:42,960 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-04-17 22:52:43,345 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-04-17 22:52:43,514 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2020-04-17 22:52:43,664 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-04-17 22:52:44,059 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2020-04-17 22:52:44,235 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-04-17 22:52:44,834 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2020-04-17 22:52:45,022 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-04-17 22:52:45,210 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-04-17 22:52:45,747 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-04-17 22:52:45,950 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2020-04-17 22:52:46,413 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-04-17 22:52:46,627 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2020-04-17 22:52:47,653 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2020-04-17 22:52:47,920 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-17 22:52:48,075 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2020-04-17 22:52:48,265 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-04-17 22:52:48,565 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-04-17 22:52:48,751 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-04-17 22:52:48,935 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-04-17 22:52:49,115 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-04-17 22:52:49,377 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2020-04-17 22:52:49,599 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2020-04-17 22:52:49,807 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-04-17 22:52:50,179 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2020-04-17 22:52:50,431 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2020-04-17 22:52:50,634 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2020-04-17 22:52:50,811 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-04-17 22:52:51,097 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2020-04-17 22:52:51,368 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2020-04-17 22:52:51,622 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2020-04-17 22:52:51,947 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2020-04-17 22:52:52,257 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2020-04-17 22:52:52,583 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2020-04-17 22:52:52,902 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2020-04-17 22:52:53,366 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2020-04-17 22:52:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:52:53,621 INFO L93 Difference]: Finished difference Result 11014 states and 37022 transitions. [2020-04-17 22:52:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-04-17 22:52:53,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-04-17 22:52:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:52:53,644 INFO L225 Difference]: With dead ends: 11014 [2020-04-17 22:52:53,645 INFO L226 Difference]: Without dead ends: 11014 [2020-04-17 22:52:53,646 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1338, Invalid=3492, Unknown=0, NotChecked=0, Total=4830 [2020-04-17 22:52:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11014 states. [2020-04-17 22:52:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11014 to 10814. [2020-04-17 22:52:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10814 states. [2020-04-17 22:52:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10814 states to 10814 states and 36442 transitions. [2020-04-17 22:52:53,820 INFO L78 Accepts]: Start accepts. Automaton has 10814 states and 36442 transitions. Word has length 31 [2020-04-17 22:52:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:52:53,821 INFO L479 AbstractCegarLoop]: Abstraction has 10814 states and 36442 transitions. [2020-04-17 22:52:53,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 22:52:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10814 states and 36442 transitions. [2020-04-17 22:52:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:52:53,833 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:52:53,833 INFO L425 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] [2020-04-17 22:52:53,833 INFO L427 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:52:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:52:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1133622845, now seen corresponding path program 4 times [2020-04-17 22:52:53,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:52:53,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133380204] [2020-04-17 22:52:53,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:52:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:52:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:52:54,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133380204] [2020-04-17 22:52:54,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:52:54,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:52:54,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961907080] [2020-04-17 22:52:54,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:52:54,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:52:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:52:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:52:54,645 INFO L87 Difference]: Start difference. First operand 10814 states and 36442 transitions. Second operand 19 states. [2020-04-17 22:52:56,231 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-04-17 22:52:56,975 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-04-17 22:52:57,179 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-04-17 22:52:57,359 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-04-17 22:52:57,624 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-04-17 22:52:57,901 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 22:52:58,202 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2020-04-17 22:52:58,457 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2020-04-17 22:52:58,760 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2020-04-17 22:52:58,945 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2020-04-17 22:52:59,235 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2020-04-17 22:52:59,753 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2020-04-17 22:53:00,023 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-04-17 22:53:00,576 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2020-04-17 22:53:00,800 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2020-04-17 22:53:01,869 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2020-04-17 22:53:02,651 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 22:53:02,822 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-04-17 22:53:03,289 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2020-04-17 22:53:03,491 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-04-17 22:53:03,694 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-04-17 22:53:03,932 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-04-17 22:53:04,176 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2020-04-17 22:53:04,467 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2020-04-17 22:53:04,695 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-04-17 22:53:04,983 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-04-17 22:53:05,254 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2020-04-17 22:53:05,518 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2020-04-17 22:53:05,770 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2020-04-17 22:53:06,040 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-04-17 22:53:06,319 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2020-04-17 22:53:06,594 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2020-04-17 22:53:06,956 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2020-04-17 22:53:07,366 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2020-04-17 22:53:07,734 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2020-04-17 22:53:08,049 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2020-04-17 22:53:08,629 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 81 [2020-04-17 22:53:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:08,999 INFO L93 Difference]: Finished difference Result 13779 states and 45387 transitions. [2020-04-17 22:53:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-04-17 22:53:08,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-04-17 22:53:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:09,020 INFO L225 Difference]: With dead ends: 13779 [2020-04-17 22:53:09,020 INFO L226 Difference]: Without dead ends: 13779 [2020-04-17 22:53:09,022 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1581, Invalid=4119, Unknown=0, NotChecked=0, Total=5700 [2020-04-17 22:53:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13779 states. [2020-04-17 22:53:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13779 to 11338. [2020-04-17 22:53:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2020-04-17 22:53:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 38054 transitions. [2020-04-17 22:53:09,193 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 38054 transitions. Word has length 31 [2020-04-17 22:53:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:09,194 INFO L479 AbstractCegarLoop]: Abstraction has 11338 states and 38054 transitions. [2020-04-17 22:53:09,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:53:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 38054 transitions. [2020-04-17 22:53:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:53:09,206 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:09,206 INFO L425 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] [2020-04-17 22:53:09,206 INFO L427 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:53:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash 344966205, now seen corresponding path program 5 times [2020-04-17 22:53:09,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:09,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127557132] [2020-04-17 22:53:09,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:53:09,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127557132] [2020-04-17 22:53:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:53:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593776723] [2020-04-17 22:53:09,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:53:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:53:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:53:09,987 INFO L87 Difference]: Start difference. First operand 11338 states and 38054 transitions. Second operand 19 states. [2020-04-17 22:53:11,634 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-04-17 22:53:12,164 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2020-04-17 22:53:12,349 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2020-04-17 22:53:12,508 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2020-04-17 22:53:12,747 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-04-17 22:53:13,022 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2020-04-17 22:53:13,156 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:53:13,402 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2020-04-17 22:53:13,687 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2020-04-17 22:53:13,978 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2020-04-17 22:53:14,169 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-04-17 22:53:14,453 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 22:53:14,751 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-04-17 22:53:15,209 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2020-04-17 22:53:15,470 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2020-04-17 22:53:16,014 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2020-04-17 22:53:16,232 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2020-04-17 22:53:17,247 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2020-04-17 22:53:17,964 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2020-04-17 22:53:18,116 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-04-17 22:53:18,552 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-04-17 22:53:18,733 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-04-17 22:53:18,910 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:53:19,112 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 22:53:19,358 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-04-17 22:53:19,631 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2020-04-17 22:53:19,844 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2020-04-17 22:53:20,086 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-04-17 22:53:20,339 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2020-04-17 22:53:20,587 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2020-04-17 22:53:20,791 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2020-04-17 22:53:21,040 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2020-04-17 22:53:21,298 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2020-04-17 22:53:21,542 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-04-17 22:53:21,803 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2020-04-17 22:53:22,066 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2020-04-17 22:53:22,374 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2020-04-17 22:53:22,740 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2020-04-17 22:53:23,023 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2020-04-17 22:53:23,549 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2020-04-17 22:53:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:23,924 INFO L93 Difference]: Finished difference Result 14291 states and 46985 transitions. [2020-04-17 22:53:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-04-17 22:53:23,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-04-17 22:53:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:23,945 INFO L225 Difference]: With dead ends: 14291 [2020-04-17 22:53:23,945 INFO L226 Difference]: Without dead ends: 14291 [2020-04-17 22:53:23,947 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1719, Invalid=4443, Unknown=0, NotChecked=0, Total=6162 [2020-04-17 22:53:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14291 states. [2020-04-17 22:53:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14291 to 11341. [2020-04-17 22:53:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11341 states. [2020-04-17 22:53:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11341 states to 11341 states and 38065 transitions. [2020-04-17 22:53:24,110 INFO L78 Accepts]: Start accepts. Automaton has 11341 states and 38065 transitions. Word has length 31 [2020-04-17 22:53:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:24,110 INFO L479 AbstractCegarLoop]: Abstraction has 11341 states and 38065 transitions. [2020-04-17 22:53:24,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:53:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11341 states and 38065 transitions. [2020-04-17 22:53:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:53:24,122 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:24,122 INFO L425 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] [2020-04-17 22:53:24,122 INFO L427 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:53:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash -205504873, now seen corresponding path program 6 times [2020-04-17 22:53:24,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:24,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438812270] [2020-04-17 22:53:24,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:53:25,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438812270] [2020-04-17 22:53:25,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:25,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:53:25,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027771218] [2020-04-17 22:53:25,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:53:25,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:53:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:53:25,068 INFO L87 Difference]: Start difference. First operand 11341 states and 38065 transitions. Second operand 19 states. [2020-04-17 22:53:26,782 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-04-17 22:53:27,529 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-04-17 22:53:27,683 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2020-04-17 22:53:27,871 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2020-04-17 22:53:28,029 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2020-04-17 22:53:28,204 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-04-17 22:53:28,758 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2020-04-17 22:53:28,900 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:53:29,057 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2020-04-17 22:53:29,280 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 22:53:30,148 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-04-17 22:53:30,365 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2020-04-17 22:53:30,581 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-04-17 22:53:30,820 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2020-04-17 22:53:31,014 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-04-17 22:53:31,179 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2020-04-17 22:53:31,785 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2020-04-17 22:53:32,024 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2020-04-17 22:53:32,307 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2020-04-17 22:53:32,520 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-04-17 22:53:32,724 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-04-17 22:53:33,401 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2020-04-17 22:53:33,630 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2020-04-17 22:53:33,898 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2020-04-17 22:53:34,680 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-04-17 22:53:35,507 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2020-04-17 22:53:35,796 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2020-04-17 22:53:36,653 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-04-17 22:53:37,330 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-04-17 22:53:37,528 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-04-17 22:53:37,719 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2020-04-17 22:53:38,094 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2020-04-17 22:53:38,388 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-04-17 22:53:38,607 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-04-17 22:53:39,016 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2020-04-17 22:53:39,275 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2020-04-17 22:53:39,484 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2020-04-17 22:53:39,647 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-04-17 22:53:39,925 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-04-17 22:53:40,190 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-04-17 22:53:40,436 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-04-17 22:53:40,646 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-04-17 22:53:41,003 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2020-04-17 22:53:41,298 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2020-04-17 22:53:41,555 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-04-17 22:53:41,956 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2020-04-17 22:53:42,339 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2020-04-17 22:53:42,627 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2020-04-17 22:53:43,208 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2020-04-17 22:53:43,530 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 76 [2020-04-17 22:53:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:43,879 INFO L93 Difference]: Finished difference Result 14397 states and 47211 transitions. [2020-04-17 22:53:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2020-04-17 22:53:43,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-04-17 22:53:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:43,900 INFO L225 Difference]: With dead ends: 14397 [2020-04-17 22:53:43,901 INFO L226 Difference]: Without dead ends: 14397 [2020-04-17 22:53:43,902 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2169, Invalid=6573, Unknown=0, NotChecked=0, Total=8742 [2020-04-17 22:53:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14397 states. [2020-04-17 22:53:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14397 to 11773. [2020-04-17 22:53:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11773 states. [2020-04-17 22:53:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11773 states to 11773 states and 39363 transitions. [2020-04-17 22:53:44,065 INFO L78 Accepts]: Start accepts. Automaton has 11773 states and 39363 transitions. Word has length 31 [2020-04-17 22:53:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:44,065 INFO L479 AbstractCegarLoop]: Abstraction has 11773 states and 39363 transitions. [2020-04-17 22:53:44,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:53:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11773 states and 39363 transitions. [2020-04-17 22:53:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:53:44,078 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:44,078 INFO L425 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] [2020-04-17 22:53:44,078 INFO L427 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:53:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -863975519, now seen corresponding path program 7 times [2020-04-17 22:53:44,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:44,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687358707] [2020-04-17 22:53:44,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:53:44,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687358707] [2020-04-17 22:53:44,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:44,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:53:44,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150761772] [2020-04-17 22:53:44,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:53:44,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:53:44,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:53:44,963 INFO L87 Difference]: Start difference. First operand 11773 states and 39363 transitions. Second operand 19 states. [2020-04-17 22:53:46,636 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-04-17 22:53:47,017 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2020-04-17 22:53:47,405 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-04-17 22:53:47,569 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2020-04-17 22:53:48,190 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-04-17 22:53:48,579 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 22:53:48,769 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2020-04-17 22:53:48,965 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2020-04-17 22:53:49,300 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-04-17 22:53:49,843 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2020-04-17 22:53:50,296 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-04-17 22:53:50,807 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-04-17 22:53:51,185 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-04-17 22:53:51,416 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-04-17 22:53:51,712 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2020-04-17 22:53:51,997 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-04-17 22:53:52,225 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2020-04-17 22:53:52,466 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2020-04-17 22:53:52,669 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2020-04-17 22:53:52,950 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-04-17 22:53:53,179 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2020-04-17 22:53:53,431 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2020-04-17 22:53:53,685 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-04-17 22:53:54,024 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-04-17 22:53:54,294 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-04-17 22:53:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 22:53:54,548 INFO L93 Difference]: Finished difference Result 13133 states and 43453 transitions. [2020-04-17 22:53:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-04-17 22:53:54,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-04-17 22:53:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 22:53:54,567 INFO L225 Difference]: With dead ends: 13133 [2020-04-17 22:53:54,567 INFO L226 Difference]: Without dead ends: 13133 [2020-04-17 22:53:54,568 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=994, Invalid=2546, Unknown=0, NotChecked=0, Total=3540 [2020-04-17 22:53:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13133 states. [2020-04-17 22:53:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13133 to 11775. [2020-04-17 22:53:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11775 states. [2020-04-17 22:53:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11775 states to 11775 states and 39369 transitions. [2020-04-17 22:53:54,717 INFO L78 Accepts]: Start accepts. Automaton has 11775 states and 39369 transitions. Word has length 31 [2020-04-17 22:53:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 22:53:54,717 INFO L479 AbstractCegarLoop]: Abstraction has 11775 states and 39369 transitions. [2020-04-17 22:53:54,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 22:53:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11775 states and 39369 transitions. [2020-04-17 22:53:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-04-17 22:53:54,728 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 22:53:54,728 INFO L425 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] [2020-04-17 22:53:54,728 INFO L427 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 22:53:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 22:53:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1652632159, now seen corresponding path program 8 times [2020-04-17 22:53:54,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 22:53:54,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485795928] [2020-04-17 22:53:54,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 22:53:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 22:53:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-17 22:53:55,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485795928] [2020-04-17 22:53:55,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 22:53:55,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-04-17 22:53:55,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425296333] [2020-04-17 22:53:55,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 22:53:55,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 22:53:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 22:53:55,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-04-17 22:53:55,533 INFO L87 Difference]: Start difference. First operand 11775 states and 39369 transitions. Second operand 19 states. [2020-04-17 22:53:57,511 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 22:53:58,126 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-04-17 22:53:58,392 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-04-17 22:53:58,598 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-04-17 22:53:58,997 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-04-17 22:53:59,352 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-04-17 22:53:59,498 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2020-04-17 22:53:59,796 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 Received shutdown request... [2020-04-17 22:54:00,250 WARN L209 SmtUtils]: Removed 36 from assertion stack [2020-04-17 22:54:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-17 22:54:00,251 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-17 22:54:00,254 WARN L228 ceAbstractionStarter]: Timeout [2020-04-17 22:54:00,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.04 10:54:00 BasicIcfg [2020-04-17 22:54:00,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-17 22:54:00,256 INFO L168 Benchmark]: Toolchain (without parser) took 242826.54 ms. Allocated memory was 137.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 287.8 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,256 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.25 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 98.0 MB in the beginning and 122.7 MB in the end (delta: -24.7 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.10 ms. Allocated memory is still 201.9 MB. Free memory was 122.7 MB in the beginning and 119.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,257 INFO L168 Benchmark]: Boogie Preprocessor took 59.00 ms. Allocated memory is still 201.9 MB. Free memory was 119.9 MB in the beginning and 117.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,258 INFO L168 Benchmark]: RCFGBuilder took 785.76 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 117.1 MB in the beginning and 194.1 MB in the end (delta: -77.0 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,258 INFO L168 Benchmark]: TraceAbstraction took 240861.03 ms. Allocated memory was 233.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 194.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 286.1 MB. Max. memory is 7.1 GB. [2020-04-17 22:54:00,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1013.25 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 98.0 MB in the beginning and 122.7 MB in the end (delta: -24.7 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.10 ms. Allocated memory is still 201.9 MB. Free memory was 122.7 MB in the beginning and 119.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.00 ms. Allocated memory is still 201.9 MB. Free memory was 119.9 MB in the beginning and 117.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.76 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 117.1 MB in the beginning and 194.1 MB in the end (delta: -77.0 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240861.03 ms. Allocated memory was 233.8 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 194.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 286.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 177 ProgramPointsBefore, 59 ProgramPointsAfterwards, 189 TransitionsBefore, 65 TransitionsAfterwards, 15102 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 6 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 118 SemBasedMoverChecksPositive, 118 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 20924 CheckedPairsTotal, 153 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (11775states) and FLOYD_HOARE automaton (currently 34 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 88 for 14ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (11775states) and FLOYD_HOARE automaton (currently 34 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 88 for 14ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (11775states) and FLOYD_HOARE automaton (currently 34 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 88 for 14ms.. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (11775states) and FLOYD_HOARE automaton (currently 34 states, 19 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 88 for 14ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 240.6s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 199.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 2916 SDtfs, 13339 SDslu, 13728 SDs, 0 SdLazy, 83844 SolverSat, 1567 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1477 GetRequests, 35 SyntacticMatches, 40 SemanticMatches, 1401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10333 ImplicationChecksByTransitivity, 119.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12246occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 91999 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 875433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown