/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-17 18:34:11,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-17 18:34:11,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-17 18:34:11,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-17 18:34:11,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-17 18:34:11,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-17 18:34:11,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-17 18:34:11,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-17 18:34:11,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-17 18:34:11,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-17 18:34:11,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-17 18:34:11,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-17 18:34:11,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-17 18:34:11,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-17 18:34:11,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-17 18:34:11,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-17 18:34:11,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-17 18:34:11,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-17 18:34:11,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-17 18:34:11,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-17 18:34:11,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-17 18:34:11,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-17 18:34:11,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-17 18:34:11,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-17 18:34:11,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-17 18:34:11,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-17 18:34:11,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-17 18:34:11,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-17 18:34:11,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-17 18:34:11,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-17 18:34:11,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-17 18:34:11,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-17 18:34:11,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-17 18:34:11,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-17 18:34:11,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-17 18:34:11,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-17 18:34:11,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-17 18:34:11,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-17 18:34:11,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-17 18:34:11,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-17 18:34:11,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-17 18:34:11,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-04-17 18:34:11,307 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-17 18:34:11,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-17 18:34:11,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-17 18:34:11,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-17 18:34:11,309 INFO L138 SettingsManager]: * Use SBE=true [2020-04-17 18:34:11,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-17 18:34:11,314 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-17 18:34:11,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-17 18:34:11,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-17 18:34:11,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-17 18:34:11,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-17 18:34:11,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-17 18:34:11,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-17 18:34:11,315 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-17 18:34:11,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-17 18:34:11,315 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-17 18:34:11,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-17 18:34:11,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-17 18:34:11,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-17 18:34:11,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-17 18:34:11,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-17 18:34:11,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-17 18:34:11,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-17 18:34:11,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-17 18:34:11,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-17 18:34:11,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-04-17 18:34:11,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-17 18:34:11,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-17 18:34:11,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-04-17 18:34:11,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-17 18:34:11,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-17 18:34:11,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-17 18:34:11,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-17 18:34:11,612 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-17 18:34:11,612 INFO L275 PluginConnector]: CDTParser initialized [2020-04-17 18:34:11,613 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2020-04-17 18:34:11,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba175010/4aac19d4ce6944d9972834cf3586e5ec/FLAGec73eb3dd [2020-04-17 18:34:12,229 INFO L306 CDTParser]: Found 1 translation units. [2020-04-17 18:34:12,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2020-04-17 18:34:12,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba175010/4aac19d4ce6944d9972834cf3586e5ec/FLAGec73eb3dd [2020-04-17 18:34:12,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba175010/4aac19d4ce6944d9972834cf3586e5ec [2020-04-17 18:34:12,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-17 18:34:12,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-17 18:34:12,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-17 18:34:12,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-17 18:34:12,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-17 18:34:12,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 06:34:12" (1/1) ... [2020-04-17 18:34:12,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a14cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:12, skipping insertion in model container [2020-04-17 18:34:12,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.04 06:34:12" (1/1) ... [2020-04-17 18:34:12,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-17 18:34:12,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-17 18:34:12,847 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 18:34:13,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 18:34:13,258 INFO L203 MainTranslator]: Completed pre-run [2020-04-17 18:34:13,274 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-04-17 18:34:13,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-17 18:34:13,499 INFO L208 MainTranslator]: Completed translation [2020-04-17 18:34:13,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13 WrapperNode [2020-04-17 18:34:13,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-17 18:34:13,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-17 18:34:13,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-17 18:34:13,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-17 18:34:13,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-17 18:34:13,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-17 18:34:13,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-17 18:34:13,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-17 18:34:13,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (1/1) ... [2020-04-17 18:34:13,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-17 18:34:13,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-17 18:34:13,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-17 18:34:13,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-17 18:34:13,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (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 18:34:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-04-17 18:34:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-04-17 18:34:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-04-17 18:34:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-04-17 18:34:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-17 18:34:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-17 18:34:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-17 18:34:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-17 18:34:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-17 18:34:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-17 18:34:13,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-17 18:34:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-17 18:34:13,719 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 18:34:14,405 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-17 18:34:14,406 INFO L295 CfgBuilder]: Removed 22 assume(true) statements. [2020-04-17 18:34:14,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 06:34:14 BoogieIcfgContainer [2020-04-17 18:34:14,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-17 18:34:14,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-17 18:34:14,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-17 18:34:14,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-17 18:34:14,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.04 06:34:12" (1/3) ... [2020-04-17 18:34:14,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf1a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 06:34:14, skipping insertion in model container [2020-04-17 18:34:14,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.04 06:34:13" (2/3) ... [2020-04-17 18:34:14,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf1a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.04 06:34:14, skipping insertion in model container [2020-04-17 18:34:14,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.04 06:34:14" (3/3) ... [2020-04-17 18:34:14,418 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2020-04-17 18:34:14,427 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-17 18:34:14,428 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-17 18:34:14,435 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-04-17 18:34:14,436 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-17 18:34:14,473 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,474 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,474 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,474 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,475 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,475 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,475 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,475 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,475 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,476 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,476 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,476 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,476 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,477 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,477 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,477 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,477 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,477 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,478 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,479 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,479 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,479 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,479 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,480 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,481 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,481 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,481 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,481 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,481 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,482 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,482 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,482 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,482 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,482 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,483 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,483 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,483 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,483 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,483 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,484 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,484 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,484 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,484 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,484 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,485 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,486 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,487 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,488 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,488 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,489 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,490 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,490 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,490 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,490 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,491 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,491 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,491 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,492 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,492 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,492 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,492 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,492 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,493 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,493 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,493 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,493 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,493 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,494 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,494 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,495 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,495 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,495 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,495 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,496 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,497 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,497 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,497 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,497 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,498 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,499 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,499 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,499 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,499 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,499 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,500 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,500 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,500 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,500 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,500 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,501 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,501 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,501 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,501 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,501 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,502 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,503 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,504 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,504 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,504 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,505 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,505 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,505 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,506 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,507 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,507 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,507 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,508 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,509 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,510 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,510 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,510 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,510 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,510 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,511 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,512 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,513 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,513 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,513 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,513 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,513 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,514 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,514 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,514 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,514 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,514 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,515 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,516 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,516 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,516 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,516 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,516 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,517 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,517 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,517 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,517 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,521 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,521 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,522 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,522 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,523 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,523 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,524 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,524 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,525 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,526 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,526 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,527 WARN L315 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,527 WARN L315 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,533 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,533 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,534 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,534 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,535 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,536 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,536 WARN L315 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,536 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,536 WARN L315 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-17 18:34:14,558 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-17 18:34:14,578 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-17 18:34:14,578 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-17 18:34:14,578 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-17 18:34:14,578 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-17 18:34:14,579 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-17 18:34:14,579 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-17 18:34:14,579 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-17 18:34:14,579 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-17 18:34:14,598 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 201 transitions, 424 flow [2020-04-17 18:34:14,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-17 18:34:14,685 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-17 18:34:14,685 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 18:34:14,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-04-17 18:34:14,709 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 189 places, 201 transitions, 424 flow [2020-04-17 18:34:14,769 INFO L129 PetriNetUnfolder]: 18/201 cut-off events. [2020-04-17 18:34:14,770 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-17 18:34:14,774 INFO L80 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 201 events. 18/201 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-04-17 18:34:14,789 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16584 [2020-04-17 18:34:14,790 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-17 18:34:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:17,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:17,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:18,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-17 18:34:19,321 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-04-17 18:34:19,434 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-04-17 18:34:19,759 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-04-17 18:34:19,881 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-04-17 18:34:20,086 INFO L206 etLargeBlockEncoding]: Checked pairs total: 27423 [2020-04-17 18:34:20,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 166 [2020-04-17 18:34:20,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 65 transitions, 152 flow [2020-04-17 18:34:20,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2020-04-17 18:34:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2020-04-17 18:34:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-17 18:34:20,235 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:20,236 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 18:34:20,236 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:20,243 INFO L82 PathProgramCache]: Analyzing trace with hash 244665820, now seen corresponding path program 1 times [2020-04-17 18:34:20,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:20,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630965385] [2020-04-17 18:34:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:20,709 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 18:34:20,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630965385] [2020-04-17 18:34:20,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:20,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-17 18:34:20,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037201662] [2020-04-17 18:34:20,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-17 18:34:20,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-17 18:34:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-04-17 18:34:20,735 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 6 states. [2020-04-17 18:34:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:21,202 INFO L93 Difference]: Finished difference Result 2543 states and 8173 transitions. [2020-04-17 18:34:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 18:34:21,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-04-17 18:34:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:21,256 INFO L225 Difference]: With dead ends: 2543 [2020-04-17 18:34:21,256 INFO L226 Difference]: Without dead ends: 2405 [2020-04-17 18:34:21,257 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 18:34:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2020-04-17 18:34:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2020-04-17 18:34:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2020-04-17 18:34:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2020-04-17 18:34:21,451 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2020-04-17 18:34:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:21,451 INFO L479 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2020-04-17 18:34:21,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-17 18:34:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2020-04-17 18:34:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 18:34:21,457 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:21,457 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 18:34:21,457 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1321724129, now seen corresponding path program 1 times [2020-04-17 18:34:21,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:21,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504032500] [2020-04-17 18:34:21,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:21,681 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 18:34:21,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504032500] [2020-04-17 18:34:21,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:21,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 18:34:21,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565057509] [2020-04-17 18:34:21,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 18:34:21,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 18:34:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-04-17 18:34:21,685 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2020-04-17 18:34:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:22,317 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2020-04-17 18:34:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-17 18:34:22,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-17 18:34:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:22,355 INFO L225 Difference]: With dead ends: 3979 [2020-04-17 18:34:22,355 INFO L226 Difference]: Without dead ends: 3939 [2020-04-17 18:34:22,358 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-04-17 18:34:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2020-04-17 18:34:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2020-04-17 18:34:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-04-17 18:34:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2020-04-17 18:34:22,491 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2020-04-17 18:34:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:22,491 INFO L479 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2020-04-17 18:34:22,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 18:34:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2020-04-17 18:34:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-17 18:34:22,496 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:22,496 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 18:34:22,496 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash 422147485, now seen corresponding path program 2 times [2020-04-17 18:34:22,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:22,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522736490] [2020-04-17 18:34:22,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:22,875 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 18:34:22,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522736490] [2020-04-17 18:34:22,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:22,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-17 18:34:22,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014910688] [2020-04-17 18:34:22,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-17 18:34:22,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-17 18:34:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-17 18:34:22,879 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2020-04-17 18:34:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:23,363 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2020-04-17 18:34:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-17 18:34:23,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-04-17 18:34:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:23,388 INFO L225 Difference]: With dead ends: 3485 [2020-04-17 18:34:23,388 INFO L226 Difference]: Without dead ends: 3437 [2020-04-17 18:34:23,388 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-04-17 18:34:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-04-17 18:34:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2020-04-17 18:34:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-04-17 18:34:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2020-04-17 18:34:23,485 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2020-04-17 18:34:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:23,486 INFO L479 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2020-04-17 18:34:23,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-17 18:34:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2020-04-17 18:34:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:23,492 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:23,492 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 18:34:23,492 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 456238224, now seen corresponding path program 1 times [2020-04-17 18:34:23,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:23,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845187799] [2020-04-17 18:34:23,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:23,954 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 18:34:23,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845187799] [2020-04-17 18:34:23,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:23,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:23,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283450922] [2020-04-17 18:34:23,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:23,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:23,957 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 13 states. [2020-04-17 18:34:24,228 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2020-04-17 18:34:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:25,737 INFO L93 Difference]: Finished difference Result 3440 states and 11205 transitions. [2020-04-17 18:34:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 18:34:25,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:25,761 INFO L225 Difference]: With dead ends: 3440 [2020-04-17 18:34:25,761 INFO L226 Difference]: Without dead ends: 3440 [2020-04-17 18:34:25,762 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2020-04-17 18:34:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2020-04-17 18:34:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3017. [2020-04-17 18:34:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2020-04-17 18:34:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 9857 transitions. [2020-04-17 18:34:25,906 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 9857 transitions. Word has length 25 [2020-04-17 18:34:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:25,908 INFO L479 AbstractCegarLoop]: Abstraction has 3017 states and 9857 transitions. [2020-04-17 18:34:25,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 9857 transitions. [2020-04-17 18:34:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:25,916 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:25,916 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 18:34:25,916 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash -556454308, now seen corresponding path program 2 times [2020-04-17 18:34:25,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:25,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807445171] [2020-04-17 18:34:25,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:26,414 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 18:34:26,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807445171] [2020-04-17 18:34:26,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:26,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:26,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145327762] [2020-04-17 18:34:26,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:26,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:26,416 INFO L87 Difference]: Start difference. First operand 3017 states and 9857 transitions. Second operand 13 states. [2020-04-17 18:34:28,038 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-04-17 18:34:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:28,434 INFO L93 Difference]: Finished difference Result 3469 states and 11302 transitions. [2020-04-17 18:34:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-17 18:34:28,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:28,458 INFO L225 Difference]: With dead ends: 3469 [2020-04-17 18:34:28,458 INFO L226 Difference]: Without dead ends: 3469 [2020-04-17 18:34:28,459 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2020-04-17 18:34:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2020-04-17 18:34:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3234. [2020-04-17 18:34:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-17 18:34:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 10616 transitions. [2020-04-17 18:34:28,553 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 10616 transitions. Word has length 25 [2020-04-17 18:34:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:28,553 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 10616 transitions. [2020-04-17 18:34:28,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 10616 transitions. [2020-04-17 18:34:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:28,560 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:28,560 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 18:34:28,560 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash -389201428, now seen corresponding path program 3 times [2020-04-17 18:34:28,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:28,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514486816] [2020-04-17 18:34:28,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:29,047 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 18:34:29,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514486816] [2020-04-17 18:34:29,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:29,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:29,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429184922] [2020-04-17 18:34:29,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:29,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:29,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:29,049 INFO L87 Difference]: Start difference. First operand 3234 states and 10616 transitions. Second operand 13 states. [2020-04-17 18:34:29,777 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-04-17 18:34:30,788 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-04-17 18:34:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:31,083 INFO L93 Difference]: Finished difference Result 3504 states and 11329 transitions. [2020-04-17 18:34:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 18:34:31,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:31,105 INFO L225 Difference]: With dead ends: 3504 [2020-04-17 18:34:31,105 INFO L226 Difference]: Without dead ends: 3504 [2020-04-17 18:34:31,106 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2020-04-17 18:34:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2020-04-17 18:34:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3388. [2020-04-17 18:34:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2020-04-17 18:34:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2020-04-17 18:34:31,192 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2020-04-17 18:34:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:31,193 INFO L479 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2020-04-17 18:34:31,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2020-04-17 18:34:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:31,200 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:31,200 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 18:34:31,200 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -624413205, now seen corresponding path program 1 times [2020-04-17 18:34:31,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:31,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262958660] [2020-04-17 18:34:31,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:31,702 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 18:34:31,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262958660] [2020-04-17 18:34:31,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:31,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:34:31,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132017380] [2020-04-17 18:34:31,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:34:31,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:31,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:34:31,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:34:31,705 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 14 states. [2020-04-17 18:34:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:33,638 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2020-04-17 18:34:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 18:34:33,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:34:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:33,651 INFO L225 Difference]: With dead ends: 4020 [2020-04-17 18:34:33,651 INFO L226 Difference]: Without dead ends: 4020 [2020-04-17 18:34:33,652 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-04-17 18:34:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-04-17 18:34:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2020-04-17 18:34:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2020-04-17 18:34:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2020-04-17 18:34:33,743 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2020-04-17 18:34:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:33,743 INFO L479 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2020-04-17 18:34:33,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:34:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2020-04-17 18:34:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:33,750 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:33,750 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 18:34:33,750 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash 106947557, now seen corresponding path program 2 times [2020-04-17 18:34:33,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:33,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42504905] [2020-04-17 18:34:33,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:34,236 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 18:34:34,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42504905] [2020-04-17 18:34:34,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:34,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:34:34,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745952334] [2020-04-17 18:34:34,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:34:34,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:34:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:34:34,238 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 14 states. [2020-04-17 18:34:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:35,954 INFO L93 Difference]: Finished difference Result 4056 states and 13114 transitions. [2020-04-17 18:34:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-17 18:34:35,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:34:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:35,967 INFO L225 Difference]: With dead ends: 4056 [2020-04-17 18:34:35,967 INFO L226 Difference]: Without dead ends: 4056 [2020-04-17 18:34:35,968 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:34:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2020-04-17 18:34:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3584. [2020-04-17 18:34:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-04-17 18:34:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11673 transitions. [2020-04-17 18:34:36,059 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11673 transitions. Word has length 25 [2020-04-17 18:34:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:36,060 INFO L479 AbstractCegarLoop]: Abstraction has 3584 states and 11673 transitions. [2020-04-17 18:34:36,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:34:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11673 transitions. [2020-04-17 18:34:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:36,068 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:36,068 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 18:34:36,068 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2012965443, now seen corresponding path program 3 times [2020-04-17 18:34:36,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:36,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465762688] [2020-04-17 18:34:36,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:36,516 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 18:34:36,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465762688] [2020-04-17 18:34:36,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:36,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:34:36,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021954773] [2020-04-17 18:34:36,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:34:36,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:36,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:34:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:34:36,560 INFO L87 Difference]: Start difference. First operand 3584 states and 11673 transitions. Second operand 14 states. [2020-04-17 18:34:38,472 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-04-17 18:34:38,614 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-04-17 18:34:38,896 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-04-17 18:34:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:39,286 INFO L93 Difference]: Finished difference Result 4022 states and 12928 transitions. [2020-04-17 18:34:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:34:39,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:34:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:39,306 INFO L225 Difference]: With dead ends: 4022 [2020-04-17 18:34:39,308 INFO L226 Difference]: Without dead ends: 4022 [2020-04-17 18:34:39,308 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:34:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2020-04-17 18:34:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3794. [2020-04-17 18:34:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2020-04-17 18:34:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 12303 transitions. [2020-04-17 18:34:39,456 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 12303 transitions. Word has length 25 [2020-04-17 18:34:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:39,457 INFO L479 AbstractCegarLoop]: Abstraction has 3794 states and 12303 transitions. [2020-04-17 18:34:39,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:34:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 12303 transitions. [2020-04-17 18:34:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:39,465 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:39,465 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 18:34:39,465 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 84923173, now seen corresponding path program 4 times [2020-04-17 18:34:39,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:39,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49025457] [2020-04-17 18:34:39,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:39,963 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-04-17 18:34:40,096 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-04-17 18:34:40,137 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 18:34:40,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49025457] [2020-04-17 18:34:40,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:40,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:40,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434301804] [2020-04-17 18:34:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:40,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:40,139 INFO L87 Difference]: Start difference. First operand 3794 states and 12303 transitions. Second operand 13 states. [2020-04-17 18:34:42,159 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-04-17 18:34:42,370 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-04-17 18:34:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:42,717 INFO L93 Difference]: Finished difference Result 4190 states and 13502 transitions. [2020-04-17 18:34:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:34:42,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:42,723 INFO L225 Difference]: With dead ends: 4190 [2020-04-17 18:34:42,724 INFO L226 Difference]: Without dead ends: 4190 [2020-04-17 18:34:42,725 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:34:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2020-04-17 18:34:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4005. [2020-04-17 18:34:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4005 states. [2020-04-17 18:34:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 12969 transitions. [2020-04-17 18:34:42,807 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 12969 transitions. Word has length 25 [2020-04-17 18:34:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:42,807 INFO L479 AbstractCegarLoop]: Abstraction has 4005 states and 12969 transitions. [2020-04-17 18:34:42,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 12969 transitions. [2020-04-17 18:34:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:42,818 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:42,819 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 18:34:42,819 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1775574389, now seen corresponding path program 5 times [2020-04-17 18:34:42,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:42,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578918285] [2020-04-17 18:34:42,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:43,375 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 18:34:43,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578918285] [2020-04-17 18:34:43,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:43,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:34:43,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104530585] [2020-04-17 18:34:43,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:34:43,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:34:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:34:43,377 INFO L87 Difference]: Start difference. First operand 4005 states and 12969 transitions. Second operand 14 states. [2020-04-17 18:34:44,622 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-04-17 18:34:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:45,086 INFO L93 Difference]: Finished difference Result 4067 states and 13143 transitions. [2020-04-17 18:34:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:34:45,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:34:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:45,093 INFO L225 Difference]: With dead ends: 4067 [2020-04-17 18:34:45,093 INFO L226 Difference]: Without dead ends: 4067 [2020-04-17 18:34:45,094 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2020-04-17 18:34:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2020-04-17 18:34:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3948. [2020-04-17 18:34:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-04-17 18:34:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2020-04-17 18:34:45,158 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2020-04-17 18:34:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:45,158 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2020-04-17 18:34:45,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:34:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2020-04-17 18:34:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:45,165 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:45,166 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 18:34:45,166 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1770005220, now seen corresponding path program 4 times [2020-04-17 18:34:45,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:45,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846511978] [2020-04-17 18:34:45,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:45,565 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 18:34:45,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846511978] [2020-04-17 18:34:45,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:45,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168511155] [2020-04-17 18:34:45,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:45,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:45,567 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2020-04-17 18:34:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:46,994 INFO L93 Difference]: Finished difference Result 4050 states and 13039 transitions. [2020-04-17 18:34:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:34:46,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:47,000 INFO L225 Difference]: With dead ends: 4050 [2020-04-17 18:34:47,001 INFO L226 Difference]: Without dead ends: 4050 [2020-04-17 18:34:47,001 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-04-17 18:34:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2020-04-17 18:34:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3990. [2020-04-17 18:34:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2020-04-17 18:34:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 12909 transitions. [2020-04-17 18:34:47,057 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 12909 transitions. Word has length 25 [2020-04-17 18:34:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:47,057 INFO L479 AbstractCegarLoop]: Abstraction has 3990 states and 12909 transitions. [2020-04-17 18:34:47,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 12909 transitions. [2020-04-17 18:34:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:47,064 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:47,065 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 18:34:47,065 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash 757312688, now seen corresponding path program 5 times [2020-04-17 18:34:47,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:47,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765519787] [2020-04-17 18:34:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:47,484 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 18:34:47,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765519787] [2020-04-17 18:34:47,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:47,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:47,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163085562] [2020-04-17 18:34:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:47,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:47,487 INFO L87 Difference]: Start difference. First operand 3990 states and 12909 transitions. Second operand 13 states. [2020-04-17 18:34:47,802 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-04-17 18:34:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:48,954 INFO L93 Difference]: Finished difference Result 4365 states and 14099 transitions. [2020-04-17 18:34:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 18:34:48,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:48,962 INFO L225 Difference]: With dead ends: 4365 [2020-04-17 18:34:48,962 INFO L226 Difference]: Without dead ends: 4365 [2020-04-17 18:34:48,962 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2020-04-17 18:34:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2020-04-17 18:34:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4186. [2020-04-17 18:34:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2020-04-17 18:34:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 13595 transitions. [2020-04-17 18:34:49,044 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 13595 transitions. Word has length 25 [2020-04-17 18:34:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:49,044 INFO L479 AbstractCegarLoop]: Abstraction has 4186 states and 13595 transitions. [2020-04-17 18:34:49,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 13595 transitions. [2020-04-17 18:34:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:49,052 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:49,052 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 18:34:49,052 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 924565568, now seen corresponding path program 6 times [2020-04-17 18:34:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:49,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986743319] [2020-04-17 18:34:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:49,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 18:34:49,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986743319] [2020-04-17 18:34:49,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:49,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:49,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790169114] [2020-04-17 18:34:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:49,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:49,533 INFO L87 Difference]: Start difference. First operand 4186 states and 13595 transitions. Second operand 13 states. [2020-04-17 18:34:51,041 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-04-17 18:34:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:51,960 INFO L93 Difference]: Finished difference Result 4946 states and 15775 transitions. [2020-04-17 18:34:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:34:51,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:51,968 INFO L225 Difference]: With dead ends: 4946 [2020-04-17 18:34:51,968 INFO L226 Difference]: Without dead ends: 4946 [2020-04-17 18:34:51,969 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:34:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2020-04-17 18:34:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 3878. [2020-04-17 18:34:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2020-04-17 18:34:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 12497 transitions. [2020-04-17 18:34:52,051 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 12497 transitions. Word has length 25 [2020-04-17 18:34:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:52,053 INFO L479 AbstractCegarLoop]: Abstraction has 3878 states and 12497 transitions. [2020-04-17 18:34:52,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 12497 transitions. [2020-04-17 18:34:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:52,061 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:52,061 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 18:34:52,062 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -908781430, now seen corresponding path program 7 times [2020-04-17 18:34:52,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:52,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91475642] [2020-04-17 18:34:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:52,545 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 18:34:52,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91475642] [2020-04-17 18:34:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-17 18:34:52,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375684827] [2020-04-17 18:34:52,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:34:52,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:34:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:34:52,547 INFO L87 Difference]: Start difference. First operand 3878 states and 12497 transitions. Second operand 13 states. [2020-04-17 18:34:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:54,050 INFO L93 Difference]: Finished difference Result 3913 states and 12607 transitions. [2020-04-17 18:34:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:34:54,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-04-17 18:34:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:54,056 INFO L225 Difference]: With dead ends: 3913 [2020-04-17 18:34:54,056 INFO L226 Difference]: Without dead ends: 3913 [2020-04-17 18:34:54,057 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2020-04-17 18:34:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2020-04-17 18:34:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3906. [2020-04-17 18:34:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2020-04-17 18:34:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 12585 transitions. [2020-04-17 18:34:54,139 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 12585 transitions. Word has length 25 [2020-04-17 18:34:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:54,139 INFO L479 AbstractCegarLoop]: Abstraction has 3906 states and 12585 transitions. [2020-04-17 18:34:54,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-17 18:34:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 12585 transitions. [2020-04-17 18:34:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:54,147 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:54,147 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 18:34:54,147 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -741528550, now seen corresponding path program 8 times [2020-04-17 18:34:54,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:54,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707920425] [2020-04-17 18:34:54,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:54,611 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 18:34:54,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707920425] [2020-04-17 18:34:54,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:54,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 18:34:54,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503545912] [2020-04-17 18:34:54,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 18:34:54,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 18:34:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-04-17 18:34:54,616 INFO L87 Difference]: Start difference. First operand 3906 states and 12585 transitions. Second operand 12 states. [2020-04-17 18:34:56,797 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2020-04-17 18:34:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:57,088 INFO L93 Difference]: Finished difference Result 4746 states and 15145 transitions. [2020-04-17 18:34:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:34:57,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 18:34:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:57,095 INFO L225 Difference]: With dead ends: 4746 [2020-04-17 18:34:57,095 INFO L226 Difference]: Without dead ends: 4746 [2020-04-17 18:34:57,096 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:34:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2020-04-17 18:34:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 3738. [2020-04-17 18:34:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2020-04-17 18:34:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 12057 transitions. [2020-04-17 18:34:57,151 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 12057 transitions. Word has length 25 [2020-04-17 18:34:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:57,152 INFO L479 AbstractCegarLoop]: Abstraction has 3738 states and 12057 transitions. [2020-04-17 18:34:57,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 18:34:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 12057 transitions. [2020-04-17 18:34:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:57,158 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:57,158 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 18:34:57,158 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:57,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1887146998, now seen corresponding path program 9 times [2020-04-17 18:34:57,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:57,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088327090] [2020-04-17 18:34:57,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:34:57,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 18:34:57,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088327090] [2020-04-17 18:34:57,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:34:57,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 18:34:57,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919965901] [2020-04-17 18:34:57,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-17 18:34:57,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:34:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-17 18:34:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-04-17 18:34:57,535 INFO L87 Difference]: Start difference. First operand 3738 states and 12057 transitions. Second operand 12 states. [2020-04-17 18:34:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:34:59,755 INFO L93 Difference]: Finished difference Result 4522 states and 14364 transitions. [2020-04-17 18:34:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:34:59,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-04-17 18:34:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:34:59,764 INFO L225 Difference]: With dead ends: 4522 [2020-04-17 18:34:59,764 INFO L226 Difference]: Without dead ends: 4522 [2020-04-17 18:34:59,764 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:34:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2020-04-17 18:34:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3612. [2020-04-17 18:34:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2020-04-17 18:34:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 11584 transitions. [2020-04-17 18:34:59,831 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 11584 transitions. Word has length 25 [2020-04-17 18:34:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:34:59,832 INFO L479 AbstractCegarLoop]: Abstraction has 3612 states and 11584 transitions. [2020-04-17 18:34:59,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-17 18:34:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 11584 transitions. [2020-04-17 18:34:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:34:59,837 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:34:59,837 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 18:34:59,837 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:34:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:34:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 831016779, now seen corresponding path program 6 times [2020-04-17 18:34:59,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:34:59,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780679798] [2020-04-17 18:34:59,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:34:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:00,269 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 18:35:00,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780679798] [2020-04-17 18:35:00,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:00,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:00,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21023855] [2020-04-17 18:35:00,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:00,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:00,271 INFO L87 Difference]: Start difference. First operand 3612 states and 11584 transitions. Second operand 14 states. [2020-04-17 18:35:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:01,818 INFO L93 Difference]: Finished difference Result 3727 states and 11871 transitions. [2020-04-17 18:35:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:35:01,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:01,824 INFO L225 Difference]: With dead ends: 3727 [2020-04-17 18:35:01,824 INFO L226 Difference]: Without dead ends: 3727 [2020-04-17 18:35:01,825 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-04-17 18:35:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2020-04-17 18:35:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3661. [2020-04-17 18:35:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3661 states. [2020-04-17 18:35:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 11739 transitions. [2020-04-17 18:35:01,889 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 11739 transitions. Word has length 25 [2020-04-17 18:35:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:01,890 INFO L479 AbstractCegarLoop]: Abstraction has 3661 states and 11739 transitions. [2020-04-17 18:35:01,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 11739 transitions. [2020-04-17 18:35:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:01,893 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:01,893 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 18:35:01,894 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1562377541, now seen corresponding path program 7 times [2020-04-17 18:35:01,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:01,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638067247] [2020-04-17 18:35:01,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:02,316 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 18:35:02,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638067247] [2020-04-17 18:35:02,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:02,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:02,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328419607] [2020-04-17 18:35:02,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:02,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:02,319 INFO L87 Difference]: Start difference. First operand 3661 states and 11739 transitions. Second operand 14 states. [2020-04-17 18:35:03,950 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-04-17 18:35:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:04,360 INFO L93 Difference]: Finished difference Result 4179 states and 13299 transitions. [2020-04-17 18:35:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-17 18:35:04,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:04,368 INFO L225 Difference]: With dead ends: 4179 [2020-04-17 18:35:04,369 INFO L226 Difference]: Without dead ends: 4179 [2020-04-17 18:35:04,369 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-04-17 18:35:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2020-04-17 18:35:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3724. [2020-04-17 18:35:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2020-04-17 18:35:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 11982 transitions. [2020-04-17 18:35:04,420 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 11982 transitions. Word has length 25 [2020-04-17 18:35:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:04,420 INFO L479 AbstractCegarLoop]: Abstraction has 3724 states and 11982 transitions. [2020-04-17 18:35:04,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 11982 transitions. [2020-04-17 18:35:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:04,424 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:04,424 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 18:35:04,424 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash -557535459, now seen corresponding path program 8 times [2020-04-17 18:35:04,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:04,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423524297] [2020-04-17 18:35:04,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:04,848 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 18:35:04,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423524297] [2020-04-17 18:35:04,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:04,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:04,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078119009] [2020-04-17 18:35:04,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:04,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:04,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:04,851 INFO L87 Difference]: Start difference. First operand 3724 states and 11982 transitions. Second operand 14 states. [2020-04-17 18:35:06,689 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-04-17 18:35:06,955 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-04-17 18:35:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:07,361 INFO L93 Difference]: Finished difference Result 4145 states and 13127 transitions. [2020-04-17 18:35:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:35:07,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:07,368 INFO L225 Difference]: With dead ends: 4145 [2020-04-17 18:35:07,368 INFO L226 Difference]: Without dead ends: 4145 [2020-04-17 18:35:07,369 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:35:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2020-04-17 18:35:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3913. [2020-04-17 18:35:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2020-04-17 18:35:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 12549 transitions. [2020-04-17 18:35:07,418 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 12549 transitions. Word has length 25 [2020-04-17 18:35:07,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:07,418 INFO L479 AbstractCegarLoop]: Abstraction has 3913 states and 12549 transitions. [2020-04-17 18:35:07,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 12549 transitions. [2020-04-17 18:35:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:07,422 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:07,422 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 18:35:07,422 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1540353157, now seen corresponding path program 9 times [2020-04-17 18:35:07,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:07,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873813130] [2020-04-17 18:35:07,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:07,816 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 18:35:07,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873813130] [2020-04-17 18:35:07,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:07,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:07,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706757548] [2020-04-17 18:35:07,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:07,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:07,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:07,821 INFO L87 Difference]: Start difference. First operand 3913 states and 12549 transitions. Second operand 14 states. [2020-04-17 18:35:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:10,387 INFO L93 Difference]: Finished difference Result 4117 states and 13043 transitions. [2020-04-17 18:35:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:35:10,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:10,394 INFO L225 Difference]: With dead ends: 4117 [2020-04-17 18:35:10,394 INFO L226 Difference]: Without dead ends: 4117 [2020-04-17 18:35:10,394 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-04-17 18:35:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2020-04-17 18:35:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3976. [2020-04-17 18:35:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2020-04-17 18:35:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 12738 transitions. [2020-04-17 18:35:10,445 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 12738 transitions. Word has length 25 [2020-04-17 18:35:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:10,445 INFO L479 AbstractCegarLoop]: Abstraction has 3976 states and 12738 transitions. [2020-04-17 18:35:10,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 12738 transitions. [2020-04-17 18:35:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:10,450 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:10,450 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 18:35:10,450 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1880873459, now seen corresponding path program 10 times [2020-04-17 18:35:10,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:10,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881737318] [2020-04-17 18:35:10,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:11,178 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 18:35:11,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881737318] [2020-04-17 18:35:11,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:11,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:11,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941903932] [2020-04-17 18:35:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:11,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:11,180 INFO L87 Difference]: Start difference. First operand 3976 states and 12738 transitions. Second operand 14 states. [2020-04-17 18:35:13,356 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-04-17 18:35:13,672 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-04-17 18:35:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:13,959 INFO L93 Difference]: Finished difference Result 4726 states and 14878 transitions. [2020-04-17 18:35:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 18:35:13,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:13,966 INFO L225 Difference]: With dead ends: 4726 [2020-04-17 18:35:13,966 INFO L226 Difference]: Without dead ends: 4726 [2020-04-17 18:35:13,966 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:35:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2020-04-17 18:35:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3542. [2020-04-17 18:35:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2020-04-17 18:35:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2020-04-17 18:35:14,015 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2020-04-17 18:35:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:14,015 INFO L479 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2020-04-17 18:35:14,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2020-04-17 18:35:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:14,018 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:14,019 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 18:35:14,019 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash -110028251, now seen corresponding path program 11 times [2020-04-17 18:35:14,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:14,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207705658] [2020-04-17 18:35:14,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:14,445 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 18:35:14,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207705658] [2020-04-17 18:35:14,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:14,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:14,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19648660] [2020-04-17 18:35:14,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:14,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:14,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:14,446 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 14 states. [2020-04-17 18:35:15,417 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-04-17 18:35:15,556 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2020-04-17 18:35:15,746 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-04-17 18:35:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:16,084 INFO L93 Difference]: Finished difference Result 3644 states and 11622 transitions. [2020-04-17 18:35:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:35:16,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:16,089 INFO L225 Difference]: With dead ends: 3644 [2020-04-17 18:35:16,090 INFO L226 Difference]: Without dead ends: 3644 [2020-04-17 18:35:16,090 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-04-17 18:35:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2020-04-17 18:35:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3584. [2020-04-17 18:35:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2020-04-17 18:35:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 11502 transitions. [2020-04-17 18:35:16,138 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 11502 transitions. Word has length 25 [2020-04-17 18:35:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:16,139 INFO L479 AbstractCegarLoop]: Abstraction has 3584 states and 11502 transitions. [2020-04-17 18:35:16,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 11502 transitions. [2020-04-17 18:35:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:16,142 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:16,142 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 18:35:16,142 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2065026045, now seen corresponding path program 12 times [2020-04-17 18:35:16,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:16,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149410922] [2020-04-17 18:35:16,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:16,530 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 18:35:16,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149410922] [2020-04-17 18:35:16,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:16,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:16,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716070727] [2020-04-17 18:35:16,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:16,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:16,531 INFO L87 Difference]: Start difference. First operand 3584 states and 11502 transitions. Second operand 14 states. [2020-04-17 18:35:18,013 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-04-17 18:35:18,166 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 18:35:18,659 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-04-17 18:35:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:19,063 INFO L93 Difference]: Finished difference Result 3945 states and 12527 transitions. [2020-04-17 18:35:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:35:19,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:19,069 INFO L225 Difference]: With dead ends: 3945 [2020-04-17 18:35:19,070 INFO L226 Difference]: Without dead ends: 3945 [2020-04-17 18:35:19,070 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:35:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2020-04-17 18:35:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3773. [2020-04-17 18:35:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3773 states. [2020-04-17 18:35:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 12069 transitions. [2020-04-17 18:35:19,117 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 12069 transitions. Word has length 25 [2020-04-17 18:35:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:19,117 INFO L479 AbstractCegarLoop]: Abstraction has 3773 states and 12069 transitions. [2020-04-17 18:35:19,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 12069 transitions. [2020-04-17 18:35:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:19,121 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:19,121 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 18:35:19,121 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash -132052635, now seen corresponding path program 13 times [2020-04-17 18:35:19,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:19,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535179434] [2020-04-17 18:35:19,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:19,522 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 18:35:19,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535179434] [2020-04-17 18:35:19,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:19,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:19,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578072444] [2020-04-17 18:35:19,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:19,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:19,524 INFO L87 Difference]: Start difference. First operand 3773 states and 12069 transitions. Second operand 14 states. [2020-04-17 18:35:21,583 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-04-17 18:35:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:21,970 INFO L93 Difference]: Finished difference Result 3917 states and 12443 transitions. [2020-04-17 18:35:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:35:21,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:22,006 INFO L225 Difference]: With dead ends: 3917 [2020-04-17 18:35:22,006 INFO L226 Difference]: Without dead ends: 3917 [2020-04-17 18:35:22,006 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:35:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2020-04-17 18:35:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3836. [2020-04-17 18:35:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2020-04-17 18:35:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12258 transitions. [2020-04-17 18:35:22,051 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12258 transitions. Word has length 25 [2020-04-17 18:35:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:22,052 INFO L479 AbstractCegarLoop]: Abstraction has 3836 states and 12258 transitions. [2020-04-17 18:35:22,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12258 transitions. [2020-04-17 18:35:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:22,055 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:22,055 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 18:35:22,056 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 741688045, now seen corresponding path program 14 times [2020-04-17 18:35:22,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:22,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053860590] [2020-04-17 18:35:22,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:22,517 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 18:35:22,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053860590] [2020-04-17 18:35:22,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:22,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:22,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696575133] [2020-04-17 18:35:22,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:22,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:22,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:22,519 INFO L87 Difference]: Start difference. First operand 3836 states and 12258 transitions. Second operand 14 states. [2020-04-17 18:35:24,849 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-04-17 18:35:25,123 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-04-17 18:35:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:25,407 INFO L93 Difference]: Finished difference Result 4526 states and 14278 transitions. [2020-04-17 18:35:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-17 18:35:25,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:25,414 INFO L225 Difference]: With dead ends: 4526 [2020-04-17 18:35:25,414 INFO L226 Difference]: Without dead ends: 4526 [2020-04-17 18:35:25,414 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2020-04-17 18:35:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2020-04-17 18:35:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3472. [2020-04-17 18:35:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2020-04-17 18:35:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 11104 transitions. [2020-04-17 18:35:25,463 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 11104 transitions. Word has length 25 [2020-04-17 18:35:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:25,463 INFO L479 AbstractCegarLoop]: Abstraction has 3472 states and 11104 transitions. [2020-04-17 18:35:25,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 11104 transitions. [2020-04-17 18:35:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:25,467 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:25,467 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 18:35:25,467 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1027185563, now seen corresponding path program 15 times [2020-04-17 18:35:25,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:25,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970578620] [2020-04-17 18:35:25,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:25,894 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 18:35:25,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970578620] [2020-04-17 18:35:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722957489] [2020-04-17 18:35:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:25,896 INFO L87 Difference]: Start difference. First operand 3472 states and 11104 transitions. Second operand 14 states. [2020-04-17 18:35:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:27,799 INFO L93 Difference]: Finished difference Result 3633 states and 11512 transitions. [2020-04-17 18:35:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:35:27,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:27,805 INFO L225 Difference]: With dead ends: 3633 [2020-04-17 18:35:27,805 INFO L226 Difference]: Without dead ends: 3633 [2020-04-17 18:35:27,805 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2020-04-17 18:35:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2020-04-17 18:35:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3633. [2020-04-17 18:35:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2020-04-17 18:35:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 11512 transitions. [2020-04-17 18:35:27,851 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 11512 transitions. Word has length 25 [2020-04-17 18:35:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:27,851 INFO L479 AbstractCegarLoop]: Abstraction has 3633 states and 11512 transitions. [2020-04-17 18:35:27,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 11512 transitions. [2020-04-17 18:35:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:27,854 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:27,855 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 18:35:27,855 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1070703053, now seen corresponding path program 16 times [2020-04-17 18:35:27,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:27,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981345552] [2020-04-17 18:35:27,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:28,273 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 18:35:28,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981345552] [2020-04-17 18:35:28,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:28,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:28,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354424537] [2020-04-17 18:35:28,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:28,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:28,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:28,275 INFO L87 Difference]: Start difference. First operand 3633 states and 11512 transitions. Second operand 14 states. [2020-04-17 18:35:30,523 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-04-17 18:35:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:30,966 INFO L93 Difference]: Finished difference Result 3724 states and 11787 transitions. [2020-04-17 18:35:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:35:30,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:30,971 INFO L225 Difference]: With dead ends: 3724 [2020-04-17 18:35:30,971 INFO L226 Difference]: Without dead ends: 3724 [2020-04-17 18:35:30,972 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:35:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-04-17 18:35:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3556. [2020-04-17 18:35:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3556 states. [2020-04-17 18:35:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 11281 transitions. [2020-04-17 18:35:31,021 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 11281 transitions. Word has length 25 [2020-04-17 18:35:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:31,022 INFO L479 AbstractCegarLoop]: Abstraction has 3556 states and 11281 transitions. [2020-04-17 18:35:31,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 11281 transitions. [2020-04-17 18:35:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:31,025 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:31,025 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 18:35:31,026 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1944443733, now seen corresponding path program 17 times [2020-04-17 18:35:31,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:31,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189257895] [2020-04-17 18:35:31,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:31,633 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 18:35:31,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189257895] [2020-04-17 18:35:31,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:31,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:31,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82761259] [2020-04-17 18:35:31,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:31,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:31,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:31,635 INFO L87 Difference]: Start difference. First operand 3556 states and 11281 transitions. Second operand 14 states. [2020-04-17 18:35:34,593 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-04-17 18:35:34,753 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-17 18:35:35,051 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2020-04-17 18:35:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:35,363 INFO L93 Difference]: Finished difference Result 4186 states and 13181 transitions. [2020-04-17 18:35:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-17 18:35:35,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:35,369 INFO L225 Difference]: With dead ends: 4186 [2020-04-17 18:35:35,370 INFO L226 Difference]: Without dead ends: 4186 [2020-04-17 18:35:35,370 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=346, Invalid=776, Unknown=0, NotChecked=0, Total=1122 [2020-04-17 18:35:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2020-04-17 18:35:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3262. [2020-04-17 18:35:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-04-17 18:35:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 10397 transitions. [2020-04-17 18:35:35,453 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 10397 transitions. Word has length 25 [2020-04-17 18:35:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:35,454 INFO L479 AbstractCegarLoop]: Abstraction has 3262 states and 10397 transitions. [2020-04-17 18:35:35,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 10397 transitions. [2020-04-17 18:35:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:35,457 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:35,457 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 18:35:35,457 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 137738405, now seen corresponding path program 18 times [2020-04-17 18:35:35,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:35,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625687587] [2020-04-17 18:35:35,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:35,855 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 18:35:35,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625687587] [2020-04-17 18:35:35,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:35,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:35,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733649959] [2020-04-17 18:35:35,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:35,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:35,857 INFO L87 Difference]: Start difference. First operand 3262 states and 10397 transitions. Second operand 14 states. [2020-04-17 18:35:37,480 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2020-04-17 18:35:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:37,768 INFO L93 Difference]: Finished difference Result 3276 states and 10441 transitions. [2020-04-17 18:35:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:35:37,768 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:37,773 INFO L225 Difference]: With dead ends: 3276 [2020-04-17 18:35:37,774 INFO L226 Difference]: Without dead ends: 3276 [2020-04-17 18:35:37,774 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2020-04-17 18:35:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2020-04-17 18:35:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2020-04-17 18:35:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2020-04-17 18:35:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 10441 transitions. [2020-04-17 18:35:37,814 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 10441 transitions. Word has length 25 [2020-04-17 18:35:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:37,814 INFO L479 AbstractCegarLoop]: Abstraction has 3276 states and 10441 transitions. [2020-04-17 18:35:37,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 10441 transitions. [2020-04-17 18:35:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-17 18:35:37,816 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:37,817 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 18:35:37,817 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1011479085, now seen corresponding path program 19 times [2020-04-17 18:35:37,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:37,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685868038] [2020-04-17 18:35:37,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:38,277 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 18:35:38,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685868038] [2020-04-17 18:35:38,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:38,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:38,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574009998] [2020-04-17 18:35:38,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-17 18:35:38,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-17 18:35:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-04-17 18:35:38,280 INFO L87 Difference]: Start difference. First operand 3276 states and 10441 transitions. Second operand 14 states. [2020-04-17 18:35:41,602 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-04-17 18:35:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:41,963 INFO L93 Difference]: Finished difference Result 4060 states and 12825 transitions. [2020-04-17 18:35:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-04-17 18:35:41,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-04-17 18:35:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:41,969 INFO L225 Difference]: With dead ends: 4060 [2020-04-17 18:35:41,970 INFO L226 Difference]: Without dead ends: 4060 [2020-04-17 18:35:41,970 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2020-04-17 18:35:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2020-04-17 18:35:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3206. [2020-04-17 18:35:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2020-04-17 18:35:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2020-04-17 18:35:42,015 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2020-04-17 18:35:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:42,015 INFO L479 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2020-04-17 18:35:42,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-17 18:35:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2020-04-17 18:35:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:35:42,018 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:42,018 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 18:35:42,018 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1573876017, now seen corresponding path program 1 times [2020-04-17 18:35:42,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:42,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310908363] [2020-04-17 18:35:42,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:42,818 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 18:35:42,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310908363] [2020-04-17 18:35:42,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:42,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:35:42,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463983009] [2020-04-17 18:35:42,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:35:42,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:35:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:35:42,820 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 16 states. [2020-04-17 18:35:44,338 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-04-17 18:35:44,548 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2020-04-17 18:35:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:45,589 INFO L93 Difference]: Finished difference Result 5138 states and 16527 transitions. [2020-04-17 18:35:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:35:45,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:35:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:45,596 INFO L225 Difference]: With dead ends: 5138 [2020-04-17 18:35:45,596 INFO L226 Difference]: Without dead ends: 5138 [2020-04-17 18:35:45,597 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:35:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2020-04-17 18:35:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3768. [2020-04-17 18:35:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2020-04-17 18:35:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12049 transitions. [2020-04-17 18:35:45,656 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12049 transitions. Word has length 27 [2020-04-17 18:35:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:45,656 INFO L479 AbstractCegarLoop]: Abstraction has 3768 states and 12049 transitions. [2020-04-17 18:35:45,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:35:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12049 transitions. [2020-04-17 18:35:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:35:45,659 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:45,659 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 18:35:45,659 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 186176923, now seen corresponding path program 2 times [2020-04-17 18:35:45,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:45,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323406959] [2020-04-17 18:35:45,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:46,145 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2020-04-17 18:35:46,333 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2020-04-17 18:35:46,681 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 18:35:46,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323406959] [2020-04-17 18:35:46,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:46,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:35:46,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096131317] [2020-04-17 18:35:46,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:35:46,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:35:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:35:46,683 INFO L87 Difference]: Start difference. First operand 3768 states and 12049 transitions. Second operand 17 states. [2020-04-17 18:35:48,367 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-04-17 18:35:48,573 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2020-04-17 18:35:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:49,805 INFO L93 Difference]: Finished difference Result 6226 states and 20077 transitions. [2020-04-17 18:35:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:35:49,805 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:35:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:49,814 INFO L225 Difference]: With dead ends: 6226 [2020-04-17 18:35:49,814 INFO L226 Difference]: Without dead ends: 6226 [2020-04-17 18:35:49,815 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2020-04-17 18:35:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2020-04-17 18:35:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 3978. [2020-04-17 18:35:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-04-17 18:35:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 12679 transitions. [2020-04-17 18:35:49,876 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 12679 transitions. Word has length 27 [2020-04-17 18:35:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:49,876 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 12679 transitions. [2020-04-17 18:35:49,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:35:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 12679 transitions. [2020-04-17 18:35:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:35:49,879 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:49,879 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 18:35:49,880 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1641843469, now seen corresponding path program 3 times [2020-04-17 18:35:49,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:49,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435129694] [2020-04-17 18:35:49,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:50,415 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 30 [2020-04-17 18:35:50,646 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 18:35:50,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435129694] [2020-04-17 18:35:50,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:50,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:35:50,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118712531] [2020-04-17 18:35:50,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:35:50,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:35:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:35:50,647 INFO L87 Difference]: Start difference. First operand 3978 states and 12679 transitions. Second operand 15 states. [2020-04-17 18:35:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:53,184 INFO L93 Difference]: Finished difference Result 6136 states and 19779 transitions. [2020-04-17 18:35:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:35:53,184 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:35:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:53,193 INFO L225 Difference]: With dead ends: 6136 [2020-04-17 18:35:53,193 INFO L226 Difference]: Without dead ends: 6136 [2020-04-17 18:35:53,194 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:35:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2020-04-17 18:35:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 4506. [2020-04-17 18:35:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-04-17 18:35:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2020-04-17 18:35:53,259 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2020-04-17 18:35:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:53,260 INFO L479 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2020-04-17 18:35:53,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:35:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2020-04-17 18:35:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:35:53,263 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:53,263 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 18:35:53,264 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 707987975, now seen corresponding path program 1 times [2020-04-17 18:35:53,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:53,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831589270] [2020-04-17 18:35:53,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:53,987 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2020-04-17 18:35:54,206 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 18:35:54,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831589270] [2020-04-17 18:35:54,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:54,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:35:54,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367681081] [2020-04-17 18:35:54,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:35:54,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:35:54,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:35:54,208 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2020-04-17 18:35:55,413 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-04-17 18:35:55,598 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:35:55,883 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 18:35:56,105 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 18:35:56,356 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-04-17 18:35:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:35:57,596 INFO L93 Difference]: Finished difference Result 6526 states and 20927 transitions. [2020-04-17 18:35:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:35:57,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:35:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:35:57,606 INFO L225 Difference]: With dead ends: 6526 [2020-04-17 18:35:57,606 INFO L226 Difference]: Without dead ends: 6526 [2020-04-17 18:35:57,607 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:35:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2020-04-17 18:35:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 4736. [2020-04-17 18:35:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2020-04-17 18:35:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2020-04-17 18:35:57,675 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2020-04-17 18:35:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:35:57,675 INFO L479 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2020-04-17 18:35:57,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:35:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2020-04-17 18:35:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:35:57,679 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:35:57,679 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 18:35:57,680 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:35:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:35:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -828956287, now seen corresponding path program 2 times [2020-04-17 18:35:57,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:35:57,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111800143] [2020-04-17 18:35:57,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:35:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:35:58,447 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 18:35:58,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111800143] [2020-04-17 18:35:58,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:35:58,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:35:58,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326312458] [2020-04-17 18:35:58,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:35:58,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:35:58,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:35:58,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:35:58,448 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2020-04-17 18:35:59,725 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-04-17 18:35:59,916 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:36:00,161 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2020-04-17 18:36:00,363 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-04-17 18:36:00,606 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2020-04-17 18:36:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:01,850 INFO L93 Difference]: Finished difference Result 7234 states and 23377 transitions. [2020-04-17 18:36:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:01,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:36:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:01,863 INFO L225 Difference]: With dead ends: 7234 [2020-04-17 18:36:01,863 INFO L226 Difference]: Without dead ends: 7234 [2020-04-17 18:36:01,863 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:36:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7234 states. [2020-04-17 18:36:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7234 to 5278. [2020-04-17 18:36:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5278 states. [2020-04-17 18:36:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5278 states to 5278 states and 16935 transitions. [2020-04-17 18:36:01,939 INFO L78 Accepts]: Start accepts. Automaton has 5278 states and 16935 transitions. Word has length 27 [2020-04-17 18:36:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:01,939 INFO L479 AbstractCegarLoop]: Abstraction has 5278 states and 16935 transitions. [2020-04-17 18:36:01,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:36:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5278 states and 16935 transitions. [2020-04-17 18:36:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:01,943 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:01,943 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 18:36:01,943 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash -828956293, now seen corresponding path program 1 times [2020-04-17 18:36:01,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:01,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706695294] [2020-04-17 18:36:01,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:02,565 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-04-17 18:36:02,797 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 18:36:02,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706695294] [2020-04-17 18:36:02,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:36:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708799288] [2020-04-17 18:36:02,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:36:02,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:36:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:36:02,799 INFO L87 Difference]: Start difference. First operand 5278 states and 16935 transitions. Second operand 17 states. [2020-04-17 18:36:03,916 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-04-17 18:36:04,064 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 18:36:04,297 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2020-04-17 18:36:04,483 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-04-17 18:36:04,706 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-04-17 18:36:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:05,848 INFO L93 Difference]: Finished difference Result 6805 states and 21785 transitions. [2020-04-17 18:36:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:05,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:36:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:05,858 INFO L225 Difference]: With dead ends: 6805 [2020-04-17 18:36:05,858 INFO L226 Difference]: Without dead ends: 6805 [2020-04-17 18:36:05,858 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:36:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2020-04-17 18:36:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 4796. [2020-04-17 18:36:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4796 states. [2020-04-17 18:36:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 15264 transitions. [2020-04-17 18:36:05,926 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 15264 transitions. Word has length 27 [2020-04-17 18:36:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:05,927 INFO L479 AbstractCegarLoop]: Abstraction has 4796 states and 15264 transitions. [2020-04-17 18:36:05,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:36:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 15264 transitions. [2020-04-17 18:36:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:05,931 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:05,931 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 18:36:05,931 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116313, now seen corresponding path program 3 times [2020-04-17 18:36:05,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:05,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358883896] [2020-04-17 18:36:05,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:06,565 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 18:36:06,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358883896] [2020-04-17 18:36:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:06,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:36:06,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234142488] [2020-04-17 18:36:06,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:36:06,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:36:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:36:06,567 INFO L87 Difference]: Start difference. First operand 4796 states and 15264 transitions. Second operand 16 states. [2020-04-17 18:36:07,426 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 18:36:07,826 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:36:08,088 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 18:36:08,382 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 18:36:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:09,964 INFO L93 Difference]: Finished difference Result 7448 states and 24096 transitions. [2020-04-17 18:36:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:36:09,964 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:36:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:09,976 INFO L225 Difference]: With dead ends: 7448 [2020-04-17 18:36:09,976 INFO L226 Difference]: Without dead ends: 7448 [2020-04-17 18:36:09,976 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2020-04-17 18:36:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5986. [2020-04-17 18:36:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2020-04-17 18:36:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 19163 transitions. [2020-04-17 18:36:10,128 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 19163 transitions. Word has length 27 [2020-04-17 18:36:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:10,128 INFO L479 AbstractCegarLoop]: Abstraction has 5986 states and 19163 transitions. [2020-04-17 18:36:10,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:36:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 19163 transitions. [2020-04-17 18:36:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:10,132 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:10,133 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 18:36:10,133 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2044116307, now seen corresponding path program 2 times [2020-04-17 18:36:10,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:10,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160804729] [2020-04-17 18:36:10,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:10,919 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 18:36:10,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160804729] [2020-04-17 18:36:10,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:10,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:36:10,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606358605] [2020-04-17 18:36:10,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:36:10,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:36:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:36:10,920 INFO L87 Difference]: Start difference. First operand 5986 states and 19163 transitions. Second operand 16 states. [2020-04-17 18:36:11,625 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-04-17 18:36:11,953 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-04-17 18:36:12,203 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-04-17 18:36:12,465 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2020-04-17 18:36:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:13,981 INFO L93 Difference]: Finished difference Result 7448 states and 23951 transitions. [2020-04-17 18:36:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:36:13,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:36:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:13,996 INFO L225 Difference]: With dead ends: 7448 [2020-04-17 18:36:13,996 INFO L226 Difference]: Without dead ends: 7448 [2020-04-17 18:36:13,996 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2020-04-17 18:36:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5180. [2020-04-17 18:36:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2020-04-17 18:36:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 16448 transitions. [2020-04-17 18:36:14,077 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 16448 transitions. Word has length 27 [2020-04-17 18:36:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:14,077 INFO L479 AbstractCegarLoop]: Abstraction has 5180 states and 16448 transitions. [2020-04-17 18:36:14,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:36:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 16448 transitions. [2020-04-17 18:36:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:14,081 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:14,081 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 18:36:14,081 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1764177885, now seen corresponding path program 4 times [2020-04-17 18:36:14,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:14,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635758724] [2020-04-17 18:36:14,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:14,720 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2020-04-17 18:36:14,917 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 18:36:14,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635758724] [2020-04-17 18:36:14,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:14,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:36:14,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175084754] [2020-04-17 18:36:14,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:36:14,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:36:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:36:14,919 INFO L87 Difference]: Start difference. First operand 5180 states and 16448 transitions. Second operand 16 states. [2020-04-17 18:36:15,215 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-04-17 18:36:16,627 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 18:36:16,836 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-04-17 18:36:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:18,174 INFO L93 Difference]: Finished difference Result 6661 states and 21391 transitions. [2020-04-17 18:36:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 18:36:18,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:36:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:18,184 INFO L225 Difference]: With dead ends: 6661 [2020-04-17 18:36:18,185 INFO L226 Difference]: Without dead ends: 6661 [2020-04-17 18:36:18,185 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-04-17 18:36:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-04-17 18:36:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 5107. [2020-04-17 18:36:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2020-04-17 18:36:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 16229 transitions. [2020-04-17 18:36:18,259 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 16229 transitions. Word has length 27 [2020-04-17 18:36:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:18,259 INFO L479 AbstractCegarLoop]: Abstraction has 5107 states and 16229 transitions. [2020-04-17 18:36:18,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:36:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 16229 transitions. [2020-04-17 18:36:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:18,264 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:18,264 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 18:36:18,264 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -4124945, now seen corresponding path program 5 times [2020-04-17 18:36:18,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:18,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459394338] [2020-04-17 18:36:18,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:18,858 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2020-04-17 18:36:19,190 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 18:36:19,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459394338] [2020-04-17 18:36:19,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:19,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:36:19,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327185255] [2020-04-17 18:36:19,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:36:19,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:36:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:36:19,192 INFO L87 Difference]: Start difference. First operand 5107 states and 16229 transitions. Second operand 17 states. [2020-04-17 18:36:20,737 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-04-17 18:36:20,906 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-04-17 18:36:21,094 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2020-04-17 18:36:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:22,274 INFO L93 Difference]: Finished difference Result 7607 states and 24383 transitions. [2020-04-17 18:36:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:36:22,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:36:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:22,285 INFO L225 Difference]: With dead ends: 7607 [2020-04-17 18:36:22,285 INFO L226 Difference]: Without dead ends: 7607 [2020-04-17 18:36:22,285 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2020-04-17 18:36:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2020-04-17 18:36:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 5296. [2020-04-17 18:36:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2020-04-17 18:36:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 16796 transitions. [2020-04-17 18:36:22,363 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 16796 transitions. Word has length 27 [2020-04-17 18:36:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:22,363 INFO L479 AbstractCegarLoop]: Abstraction has 5296 states and 16796 transitions. [2020-04-17 18:36:22,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:36:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 16796 transitions. [2020-04-17 18:36:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:22,367 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:22,367 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 18:36:22,368 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_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1451541601, now seen corresponding path program 6 times [2020-04-17 18:36:22,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:22,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307375776] [2020-04-17 18:36:22,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:23,017 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 18:36:23,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307375776] [2020-04-17 18:36:23,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:23,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:36:23,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692522095] [2020-04-17 18:36:23,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:36:23,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:36:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:36:23,018 INFO L87 Difference]: Start difference. First operand 5296 states and 16796 transitions. Second operand 15 states. [2020-04-17 18:36:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:25,825 INFO L93 Difference]: Finished difference Result 7946 states and 25504 transitions. [2020-04-17 18:36:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:36:25,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:36:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:25,837 INFO L225 Difference]: With dead ends: 7946 [2020-04-17 18:36:25,837 INFO L226 Difference]: Without dead ends: 7946 [2020-04-17 18:36:25,838 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:36:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2020-04-17 18:36:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 5044. [2020-04-17 18:36:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2020-04-17 18:36:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 16040 transitions. [2020-04-17 18:36:25,986 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 16040 transitions. Word has length 27 [2020-04-17 18:36:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:25,986 INFO L479 AbstractCegarLoop]: Abstraction has 5044 states and 16040 transitions. [2020-04-17 18:36:25,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:36:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 16040 transitions. [2020-04-17 18:36:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:25,992 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:25,992 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 18:36:25,992 INFO L427 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 902229065, now seen corresponding path program 7 times [2020-04-17 18:36:25,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:25,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895028787] [2020-04-17 18:36:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:26,773 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 18:36:26,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895028787] [2020-04-17 18:36:26,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:26,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:36:26,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502635101] [2020-04-17 18:36:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:36:26,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:36:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:36:26,775 INFO L87 Difference]: Start difference. First operand 5044 states and 16040 transitions. Second operand 16 states. [2020-04-17 18:36:28,527 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-04-17 18:36:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:29,560 INFO L93 Difference]: Finished difference Result 6570 states and 21263 transitions. [2020-04-17 18:36:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:36:29,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:36:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:29,571 INFO L225 Difference]: With dead ends: 6570 [2020-04-17 18:36:29,571 INFO L226 Difference]: Without dead ends: 6570 [2020-04-17 18:36:29,571 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6570 states. [2020-04-17 18:36:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 5501. [2020-04-17 18:36:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5501 states. [2020-04-17 18:36:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 17636 transitions. [2020-04-17 18:36:29,666 INFO L78 Accepts]: Start accepts. Automaton has 5501 states and 17636 transitions. Word has length 27 [2020-04-17 18:36:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:29,667 INFO L479 AbstractCegarLoop]: Abstraction has 5501 states and 17636 transitions. [2020-04-17 18:36:29,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:36:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5501 states and 17636 transitions. [2020-04-17 18:36:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:29,672 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:29,672 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 18:36:29,672 INFO L427 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash 902229059, now seen corresponding path program 1 times [2020-04-17 18:36:29,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:29,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111600892] [2020-04-17 18:36:29,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:30,216 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2020-04-17 18:36:30,443 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 18:36:30,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111600892] [2020-04-17 18:36:30,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:30,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:36:30,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333870174] [2020-04-17 18:36:30,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:36:30,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:36:30,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:36:30,444 INFO L87 Difference]: Start difference. First operand 5501 states and 17636 transitions. Second operand 16 states. [2020-04-17 18:36:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:33,122 INFO L93 Difference]: Finished difference Result 6141 states and 19671 transitions. [2020-04-17 18:36:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:36:33,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:36:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:33,134 INFO L225 Difference]: With dead ends: 6141 [2020-04-17 18:36:33,135 INFO L226 Difference]: Without dead ends: 6141 [2020-04-17 18:36:33,135 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6141 states. [2020-04-17 18:36:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6141 to 5023. [2020-04-17 18:36:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2020-04-17 18:36:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 15977 transitions. [2020-04-17 18:36:33,208 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 15977 transitions. Word has length 27 [2020-04-17 18:36:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:33,208 INFO L479 AbstractCegarLoop]: Abstraction has 5023 states and 15977 transitions. [2020-04-17 18:36:33,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:36:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 15977 transitions. [2020-04-17 18:36:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:33,213 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:33,213 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 18:36:33,214 INFO L427 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1937071685, now seen corresponding path program 8 times [2020-04-17 18:36:33,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:33,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954982370] [2020-04-17 18:36:33,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:33,864 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 18:36:33,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954982370] [2020-04-17 18:36:33,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:33,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:36:33,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66526727] [2020-04-17 18:36:33,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:36:33,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:36:33,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:36:33,866 INFO L87 Difference]: Start difference. First operand 5023 states and 15977 transitions. Second operand 15 states. [2020-04-17 18:36:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:36,652 INFO L93 Difference]: Finished difference Result 7813 states and 25105 transitions. [2020-04-17 18:36:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:36:36,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:36:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:36,663 INFO L225 Difference]: With dead ends: 7813 [2020-04-17 18:36:36,663 INFO L226 Difference]: Without dead ends: 7813 [2020-04-17 18:36:36,664 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:36:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2020-04-17 18:36:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 4834. [2020-04-17 18:36:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2020-04-17 18:36:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 15410 transitions. [2020-04-17 18:36:36,819 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 15410 transitions. Word has length 27 [2020-04-17 18:36:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:36,819 INFO L479 AbstractCegarLoop]: Abstraction has 4834 states and 15410 transitions. [2020-04-17 18:36:36,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:36:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 15410 transitions. [2020-04-17 18:36:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:36,823 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:36,823 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 18:36:36,823 INFO L427 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 495555017, now seen corresponding path program 9 times [2020-04-17 18:36:36,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:36,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899176952] [2020-04-17 18:36:36,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:37,463 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 18:36:37,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899176952] [2020-04-17 18:36:37,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:37,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:36:37,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720469343] [2020-04-17 18:36:37,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:36:37,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:36:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:36:37,464 INFO L87 Difference]: Start difference. First operand 4834 states and 15410 transitions. Second operand 15 states. [2020-04-17 18:36:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:40,464 INFO L93 Difference]: Finished difference Result 8170 states and 26657 transitions. [2020-04-17 18:36:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:40,464 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:36:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:40,477 INFO L225 Difference]: With dead ends: 8170 [2020-04-17 18:36:40,477 INFO L226 Difference]: Without dead ends: 8170 [2020-04-17 18:36:40,478 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2020-04-17 18:36:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5836. [2020-04-17 18:36:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5836 states. [2020-04-17 18:36:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5836 states to 5836 states and 18756 transitions. [2020-04-17 18:36:40,574 INFO L78 Accepts]: Start accepts. Automaton has 5836 states and 18756 transitions. Word has length 27 [2020-04-17 18:36:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:40,574 INFO L479 AbstractCegarLoop]: Abstraction has 5836 states and 18756 transitions. [2020-04-17 18:36:40,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:36:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5836 states and 18756 transitions. [2020-04-17 18:36:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:40,579 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:40,579 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 18:36:40,579 INFO L427 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash 495555011, now seen corresponding path program 2 times [2020-04-17 18:36:40,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:40,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989004020] [2020-04-17 18:36:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:41,013 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2020-04-17 18:36:41,229 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 18:36:41,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989004020] [2020-04-17 18:36:41,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:41,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:36:41,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653453832] [2020-04-17 18:36:41,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:36:41,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:41,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:36:41,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:36:41,230 INFO L87 Difference]: Start difference. First operand 5836 states and 18756 transitions. Second operand 15 states. [2020-04-17 18:36:42,414 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 18:36:42,689 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2020-04-17 18:36:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:44,594 INFO L93 Difference]: Finished difference Result 8170 states and 26512 transitions. [2020-04-17 18:36:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:44,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:36:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:44,607 INFO L225 Difference]: With dead ends: 8170 [2020-04-17 18:36:44,607 INFO L226 Difference]: Without dead ends: 8170 [2020-04-17 18:36:44,607 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:36:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2020-04-17 18:36:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 4886. [2020-04-17 18:36:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2020-04-17 18:36:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 15577 transitions. [2020-04-17 18:36:44,715 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 15577 transitions. Word has length 27 [2020-04-17 18:36:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:44,715 INFO L479 AbstractCegarLoop]: Abstraction has 4886 states and 15577 transitions. [2020-04-17 18:36:44,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:36:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 15577 transitions. [2020-04-17 18:36:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:44,721 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:44,721 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 18:36:44,721 INFO L427 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1660385861, now seen corresponding path program 10 times [2020-04-17 18:36:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:44,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088923749] [2020-04-17 18:36:44,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:45,112 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2020-04-17 18:36:45,236 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2020-04-17 18:36:45,438 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 18:36:45,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088923749] [2020-04-17 18:36:45,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:45,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-04-17 18:36:45,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171609642] [2020-04-17 18:36:45,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-17 18:36:45,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:45,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-17 18:36:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-04-17 18:36:45,440 INFO L87 Difference]: Start difference. First operand 4886 states and 15577 transitions. Second operand 15 states. [2020-04-17 18:36:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:48,038 INFO L93 Difference]: Finished difference Result 6800 states and 21913 transitions. [2020-04-17 18:36:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-17 18:36:48,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-04-17 18:36:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:48,049 INFO L225 Difference]: With dead ends: 6800 [2020-04-17 18:36:48,049 INFO L226 Difference]: Without dead ends: 6800 [2020-04-17 18:36:48,049 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2020-04-17 18:36:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2020-04-17 18:36:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4676. [2020-04-17 18:36:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2020-04-17 18:36:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 14927 transitions. [2020-04-17 18:36:48,119 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 14927 transitions. Word has length 27 [2020-04-17 18:36:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:48,119 INFO L479 AbstractCegarLoop]: Abstraction has 4676 states and 14927 transitions. [2020-04-17 18:36:48,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-17 18:36:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 14927 transitions. [2020-04-17 18:36:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:48,123 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:48,123 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 18:36:48,123 INFO L427 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -783135897, now seen corresponding path program 4 times [2020-04-17 18:36:48,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:48,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421021429] [2020-04-17 18:36:48,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:48,288 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2020-04-17 18:36:49,007 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 18:36:49,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421021429] [2020-04-17 18:36:49,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:49,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:36:49,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376603201] [2020-04-17 18:36:49,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:36:49,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:36:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:36:49,009 INFO L87 Difference]: Start difference. First operand 4676 states and 14927 transitions. Second operand 17 states. [2020-04-17 18:36:50,615 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2020-04-17 18:36:50,908 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-04-17 18:36:51,129 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-04-17 18:36:51,382 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2020-04-17 18:36:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:52,963 INFO L93 Difference]: Finished difference Result 6234 states and 20246 transitions. [2020-04-17 18:36:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:52,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:36:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:52,974 INFO L225 Difference]: With dead ends: 6234 [2020-04-17 18:36:52,974 INFO L226 Difference]: Without dead ends: 6234 [2020-04-17 18:36:52,974 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:36:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-04-17 18:36:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5164. [2020-04-17 18:36:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2020-04-17 18:36:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 16616 transitions. [2020-04-17 18:36:53,044 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 16616 transitions. Word has length 27 [2020-04-17 18:36:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:53,044 INFO L479 AbstractCegarLoop]: Abstraction has 5164 states and 16616 transitions. [2020-04-17 18:36:53,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:36:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 16616 transitions. [2020-04-17 18:36:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:53,049 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:53,049 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 18:36:53,049 INFO L427 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:53,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash -783135903, now seen corresponding path program 3 times [2020-04-17 18:36:53,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:53,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385298886] [2020-04-17 18:36:53,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:54,038 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 18:36:54,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385298886] [2020-04-17 18:36:54,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:54,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:36:54,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701589965] [2020-04-17 18:36:54,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:36:54,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:36:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:36:54,039 INFO L87 Difference]: Start difference. First operand 5164 states and 16616 transitions. Second operand 17 states. [2020-04-17 18:36:55,263 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-04-17 18:36:55,449 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:36:55,731 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2020-04-17 18:36:55,934 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 18:36:56,173 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2020-04-17 18:36:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:36:57,379 INFO L93 Difference]: Finished difference Result 6234 states and 20101 transitions. [2020-04-17 18:36:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:36:57,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:36:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:36:57,388 INFO L225 Difference]: With dead ends: 6234 [2020-04-17 18:36:57,388 INFO L226 Difference]: Without dead ends: 6234 [2020-04-17 18:36:57,388 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:36:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-04-17 18:36:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 4670. [2020-04-17 18:36:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2020-04-17 18:36:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 14909 transitions. [2020-04-17 18:36:57,455 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 14909 transitions. Word has length 27 [2020-04-17 18:36:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:36:57,456 INFO L479 AbstractCegarLoop]: Abstraction has 4670 states and 14909 transitions. [2020-04-17 18:36:57,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:36:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 14909 transitions. [2020-04-17 18:36:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:36:57,459 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:36:57,459 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 18:36:57,460 INFO L427 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:36:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:36:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887137, now seen corresponding path program 5 times [2020-04-17 18:36:57,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:36:57,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023047116] [2020-04-17 18:36:57,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:36:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:36:58,042 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 28 [2020-04-17 18:36:58,235 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 18:36:58,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023047116] [2020-04-17 18:36:58,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:36:58,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:36:58,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407239795] [2020-04-17 18:36:58,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:36:58,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:36:58,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:36:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:36:58,237 INFO L87 Difference]: Start difference. First operand 4670 states and 14909 transitions. Second operand 17 states. [2020-04-17 18:36:59,596 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2020-04-17 18:36:59,754 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-04-17 18:37:00,008 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-04-17 18:37:00,188 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-04-17 18:37:00,414 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2020-04-17 18:37:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:01,782 INFO L93 Difference]: Finished difference Result 7210 states and 23328 transitions. [2020-04-17 18:37:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:01,783 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:01,793 INFO L225 Difference]: With dead ends: 7210 [2020-04-17 18:37:01,793 INFO L226 Difference]: Without dead ends: 7210 [2020-04-17 18:37:01,794 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2020-04-17 18:37:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 5206. [2020-04-17 18:37:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5206 states. [2020-04-17 18:37:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 16742 transitions. [2020-04-17 18:37:01,869 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 16742 transitions. Word has length 27 [2020-04-17 18:37:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:01,870 INFO L479 AbstractCegarLoop]: Abstraction has 5206 states and 16742 transitions. [2020-04-17 18:37:01,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 16742 transitions. [2020-04-17 18:37:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:01,874 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:01,874 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 18:37:01,874 INFO L427 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1974887131, now seen corresponding path program 4 times [2020-04-17 18:37:01,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:01,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680711239] [2020-04-17 18:37:01,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:02,640 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 18:37:02,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680711239] [2020-04-17 18:37:02,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:02,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:37:02,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945543434] [2020-04-17 18:37:02,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:37:02,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:37:02,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:37:02,642 INFO L87 Difference]: Start difference. First operand 5206 states and 16742 transitions. Second operand 17 states. [2020-04-17 18:37:04,091 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2020-04-17 18:37:04,257 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2020-04-17 18:37:04,536 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2020-04-17 18:37:04,728 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-04-17 18:37:04,969 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2020-04-17 18:37:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:06,270 INFO L93 Difference]: Finished difference Result 6781 states and 21736 transitions. [2020-04-17 18:37:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:06,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:06,280 INFO L225 Difference]: With dead ends: 6781 [2020-04-17 18:37:06,280 INFO L226 Difference]: Without dead ends: 6781 [2020-04-17 18:37:06,280 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2020-04-17 18:37:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 4724. [2020-04-17 18:37:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2020-04-17 18:37:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 15071 transitions. [2020-04-17 18:37:06,351 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 15071 transitions. Word has length 27 [2020-04-17 18:37:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:06,351 INFO L479 AbstractCegarLoop]: Abstraction has 4724 states and 15071 transitions. [2020-04-17 18:37:06,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 15071 transitions. [2020-04-17 18:37:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:06,355 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:06,355 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 18:37:06,355 INFO L427 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash 552992441, now seen corresponding path program 6 times [2020-04-17 18:37:06,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:06,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348697210] [2020-04-17 18:37:06,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:07,161 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 18:37:07,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348697210] [2020-04-17 18:37:07,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:07,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:37:07,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869276169] [2020-04-17 18:37:07,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:37:07,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:37:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:37:07,162 INFO L87 Difference]: Start difference. First operand 4724 states and 15071 transitions. Second operand 16 states. [2020-04-17 18:37:07,928 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 18:37:08,295 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:37:08,548 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 18:37:08,853 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 18:37:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:10,571 INFO L93 Difference]: Finished difference Result 7546 states and 24440 transitions. [2020-04-17 18:37:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:37:10,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:37:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:10,583 INFO L225 Difference]: With dead ends: 7546 [2020-04-17 18:37:10,584 INFO L226 Difference]: Without dead ends: 7546 [2020-04-17 18:37:10,584 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:37:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2020-04-17 18:37:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5914. [2020-04-17 18:37:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5914 states. [2020-04-17 18:37:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 18970 transitions. [2020-04-17 18:37:10,669 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 18970 transitions. Word has length 27 [2020-04-17 18:37:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:10,669 INFO L479 AbstractCegarLoop]: Abstraction has 5914 states and 18970 transitions. [2020-04-17 18:37:10,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:37:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 18970 transitions. [2020-04-17 18:37:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:10,673 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:10,673 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 18:37:10,674 INFO L427 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 552992435, now seen corresponding path program 5 times [2020-04-17 18:37:10,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:10,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106939183] [2020-04-17 18:37:10,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:11,320 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 18:37:11,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106939183] [2020-04-17 18:37:11,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:11,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:37:11,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032682088] [2020-04-17 18:37:11,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:37:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:37:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:37:11,322 INFO L87 Difference]: Start difference. First operand 5914 states and 18970 transitions. Second operand 16 states. [2020-04-17 18:37:12,850 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 18:37:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:14,385 INFO L93 Difference]: Finished difference Result 7117 states and 22848 transitions. [2020-04-17 18:37:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:37:14,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:37:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:14,396 INFO L225 Difference]: With dead ends: 7117 [2020-04-17 18:37:14,396 INFO L226 Difference]: Without dead ends: 7117 [2020-04-17 18:37:14,396 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:37:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2020-04-17 18:37:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 4616. [2020-04-17 18:37:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2020-04-17 18:37:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 14747 transitions. [2020-04-17 18:37:14,465 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 14747 transitions. Word has length 27 [2020-04-17 18:37:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:14,465 INFO L479 AbstractCegarLoop]: Abstraction has 4616 states and 14747 transitions. [2020-04-17 18:37:14,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:37:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 14747 transitions. [2020-04-17 18:37:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:14,469 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:14,469 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 18:37:14,469 INFO L427 AbstractCegarLoop]: === Iteration 55 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689729, now seen corresponding path program 7 times [2020-04-17 18:37:14,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:14,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884091537] [2020-04-17 18:37:14,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:15,221 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 18:37:15,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884091537] [2020-04-17 18:37:15,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:15,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:37:15,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72689274] [2020-04-17 18:37:15,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:37:15,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:37:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:37:15,222 INFO L87 Difference]: Start difference. First operand 4616 states and 14747 transitions. Second operand 17 states. [2020-04-17 18:37:16,510 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-04-17 18:37:16,663 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-04-17 18:37:16,901 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-04-17 18:37:17,080 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-04-17 18:37:17,298 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-04-17 18:37:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:18,589 INFO L93 Difference]: Finished difference Result 6084 states and 19796 transitions. [2020-04-17 18:37:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:18,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:18,600 INFO L225 Difference]: With dead ends: 6084 [2020-04-17 18:37:18,600 INFO L226 Difference]: Without dead ends: 6084 [2020-04-17 18:37:18,600 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-04-17 18:37:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 5026. [2020-04-17 18:37:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5026 states. [2020-04-17 18:37:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 16202 transitions. [2020-04-17 18:37:18,672 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 16202 transitions. Word has length 27 [2020-04-17 18:37:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:18,672 INFO L479 AbstractCegarLoop]: Abstraction has 5026 states and 16202 transitions. [2020-04-17 18:37:18,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 16202 transitions. [2020-04-17 18:37:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:18,676 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:18,676 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 18:37:18,676 INFO L427 AbstractCegarLoop]: === Iteration 56 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1110689723, now seen corresponding path program 6 times [2020-04-17 18:37:18,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:18,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994667993] [2020-04-17 18:37:18,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:19,430 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-04-17 18:37:19,760 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 18:37:19,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994667993] [2020-04-17 18:37:19,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:19,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:37:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603163927] [2020-04-17 18:37:19,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:37:19,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:37:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:37:19,763 INFO L87 Difference]: Start difference. First operand 5026 states and 16202 transitions. Second operand 17 states. [2020-04-17 18:37:21,247 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 18:37:21,489 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-04-17 18:37:21,679 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-04-17 18:37:21,919 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-04-17 18:37:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:23,216 INFO L93 Difference]: Finished difference Result 5655 states and 18204 transitions. [2020-04-17 18:37:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:23,216 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:23,225 INFO L225 Difference]: With dead ends: 5655 [2020-04-17 18:37:23,225 INFO L226 Difference]: Without dead ends: 5655 [2020-04-17 18:37:23,225 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2020-04-17 18:37:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 4544. [2020-04-17 18:37:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2020-04-17 18:37:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 14531 transitions. [2020-04-17 18:37:23,287 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 14531 transitions. Word has length 27 [2020-04-17 18:37:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:23,287 INFO L479 AbstractCegarLoop]: Abstraction has 4544 states and 14531 transitions. [2020-04-17 18:37:23,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 14531 transitions. [2020-04-17 18:37:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:23,290 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:23,290 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 18:37:23,290 INFO L427 AbstractCegarLoop]: === Iteration 57 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash -311204967, now seen corresponding path program 8 times [2020-04-17 18:37:23,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:23,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678115050] [2020-04-17 18:37:23,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:24,013 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 18:37:24,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678115050] [2020-04-17 18:37:24,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:24,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:37:24,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994023299] [2020-04-17 18:37:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:37:24,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:37:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:37:24,015 INFO L87 Difference]: Start difference. First operand 4544 states and 14531 transitions. Second operand 16 states. [2020-04-17 18:37:24,761 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 18:37:25,112 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:37:25,368 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-04-17 18:37:25,666 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-04-17 18:37:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:27,337 INFO L93 Difference]: Finished difference Result 7354 states and 23864 transitions. [2020-04-17 18:37:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:37:27,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:37:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:27,349 INFO L225 Difference]: With dead ends: 7354 [2020-04-17 18:37:27,349 INFO L226 Difference]: Without dead ends: 7354 [2020-04-17 18:37:27,349 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:37:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2020-04-17 18:37:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 5734. [2020-04-17 18:37:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2020-04-17 18:37:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 18430 transitions. [2020-04-17 18:37:27,428 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 18430 transitions. Word has length 27 [2020-04-17 18:37:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:27,428 INFO L479 AbstractCegarLoop]: Abstraction has 5734 states and 18430 transitions. [2020-04-17 18:37:27,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:37:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 18430 transitions. [2020-04-17 18:37:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:27,432 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:27,432 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 18:37:27,433 INFO L427 AbstractCegarLoop]: === Iteration 58 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:27,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash -311204973, now seen corresponding path program 7 times [2020-04-17 18:37:27,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:27,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210901874] [2020-04-17 18:37:27,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:28,074 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 18:37:28,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210901874] [2020-04-17 18:37:28,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:28,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:37:28,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288221244] [2020-04-17 18:37:28,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:37:28,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:37:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:37:28,078 INFO L87 Difference]: Start difference. First operand 5734 states and 18430 transitions. Second operand 16 states. [2020-04-17 18:37:29,655 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-04-17 18:37:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:31,220 INFO L93 Difference]: Finished difference Result 6925 states and 22272 transitions. [2020-04-17 18:37:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-17 18:37:31,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:37:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:31,231 INFO L225 Difference]: With dead ends: 6925 [2020-04-17 18:37:31,231 INFO L226 Difference]: Without dead ends: 6925 [2020-04-17 18:37:31,232 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2020-04-17 18:37:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2020-04-17 18:37:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 4490. [2020-04-17 18:37:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4490 states. [2020-04-17 18:37:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 14369 transitions. [2020-04-17 18:37:31,320 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 14369 transitions. Word has length 27 [2020-04-17 18:37:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:31,320 INFO L479 AbstractCegarLoop]: Abstraction has 4490 states and 14369 transitions. [2020-04-17 18:37:31,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:37:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 14369 transitions. [2020-04-17 18:37:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:31,323 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:31,323 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 18:37:31,323 INFO L427 AbstractCegarLoop]: === Iteration 59 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 190808577, now seen corresponding path program 9 times [2020-04-17 18:37:31,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:31,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737963951] [2020-04-17 18:37:31,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:32,041 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2020-04-17 18:37:32,353 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 18:37:32,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737963951] [2020-04-17 18:37:32,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:32,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-04-17 18:37:32,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108255309] [2020-04-17 18:37:32,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-17 18:37:32,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-17 18:37:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-04-17 18:37:32,354 INFO L87 Difference]: Start difference. First operand 4490 states and 14369 transitions. Second operand 19 states. [2020-04-17 18:37:33,332 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 18:37:34,488 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 18:37:34,705 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-04-17 18:37:34,879 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-04-17 18:37:35,093 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-04-17 18:37:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:36,567 INFO L93 Difference]: Finished difference Result 6183 states and 20016 transitions. [2020-04-17 18:37:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:36,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-04-17 18:37:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:36,577 INFO L225 Difference]: With dead ends: 6183 [2020-04-17 18:37:36,578 INFO L226 Difference]: Without dead ends: 6183 [2020-04-17 18:37:36,578 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2020-04-17 18:37:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6183 states. [2020-04-17 18:37:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6183 to 5056. [2020-04-17 18:37:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5056 states. [2020-04-17 18:37:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 16292 transitions. [2020-04-17 18:37:36,648 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 16292 transitions. Word has length 27 [2020-04-17 18:37:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:36,648 INFO L479 AbstractCegarLoop]: Abstraction has 5056 states and 16292 transitions. [2020-04-17 18:37:36,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-17 18:37:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 16292 transitions. [2020-04-17 18:37:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:36,652 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:36,652 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 18:37:36,653 INFO L427 AbstractCegarLoop]: === Iteration 60 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:36,653 INFO L82 PathProgramCache]: Analyzing trace with hash 190808571, now seen corresponding path program 8 times [2020-04-17 18:37:36,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:36,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116212987] [2020-04-17 18:37:36,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:37,371 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 18:37:37,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116212987] [2020-04-17 18:37:37,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:37,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:37:37,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383546394] [2020-04-17 18:37:37,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:37:37,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:37:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:37:37,372 INFO L87 Difference]: Start difference. First operand 5056 states and 16292 transitions. Second operand 17 states. [2020-04-17 18:37:38,165 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-04-17 18:37:38,512 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:37:39,061 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-04-17 18:37:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:40,612 INFO L93 Difference]: Finished difference Result 6775 states and 21967 transitions. [2020-04-17 18:37:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:40,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:40,622 INFO L225 Difference]: With dead ends: 6775 [2020-04-17 18:37:40,622 INFO L226 Difference]: Without dead ends: 6775 [2020-04-17 18:37:40,623 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6775 states. [2020-04-17 18:37:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6775 to 5608. [2020-04-17 18:37:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2020-04-17 18:37:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 18052 transitions. [2020-04-17 18:37:40,704 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 18052 transitions. Word has length 27 [2020-04-17 18:37:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:40,704 INFO L479 AbstractCegarLoop]: Abstraction has 5608 states and 18052 transitions. [2020-04-17 18:37:40,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 18052 transitions. [2020-04-17 18:37:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:40,708 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:40,708 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 18:37:40,709 INFO L427 AbstractCegarLoop]: === Iteration 61 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1922106729, now seen corresponding path program 10 times [2020-04-17 18:37:40,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:40,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425341649] [2020-04-17 18:37:40,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:41,383 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 18:37:41,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425341649] [2020-04-17 18:37:41,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:41,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-04-17 18:37:41,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336679486] [2020-04-17 18:37:41,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-17 18:37:41,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-17 18:37:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-04-17 18:37:41,384 INFO L87 Difference]: Start difference. First operand 5608 states and 18052 transitions. Second operand 17 states. [2020-04-17 18:37:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:44,747 INFO L93 Difference]: Finished difference Result 7204 states and 23269 transitions. [2020-04-17 18:37:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-04-17 18:37:44,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-04-17 18:37:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:44,759 INFO L225 Difference]: With dead ends: 7204 [2020-04-17 18:37:44,759 INFO L226 Difference]: Without dead ends: 7204 [2020-04-17 18:37:44,759 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:37:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2020-04-17 18:37:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 4310. [2020-04-17 18:37:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4310 states. [2020-04-17 18:37:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 13829 transitions. [2020-04-17 18:37:44,827 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 13829 transitions. Word has length 27 [2020-04-17 18:37:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:44,827 INFO L479 AbstractCegarLoop]: Abstraction has 4310 states and 13829 transitions. [2020-04-17 18:37:44,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-17 18:37:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 13829 transitions. [2020-04-17 18:37:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:44,830 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:44,830 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 18:37:44,830 INFO L427 AbstractCegarLoop]: === Iteration 62 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722431, now seen corresponding path program 11 times [2020-04-17 18:37:44,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:44,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307591385] [2020-04-17 18:37:44,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:45,671 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 18:37:45,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307591385] [2020-04-17 18:37:45,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:45,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 18:37:45,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426636675] [2020-04-17 18:37:45,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 18:37:45,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:45,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 18:37:45,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-17 18:37:45,672 INFO L87 Difference]: Start difference. First operand 4310 states and 13829 transitions. Second operand 18 states. [2020-04-17 18:37:47,880 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:37:48,335 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-04-17 18:37:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:49,526 INFO L93 Difference]: Finished difference Result 6394 states and 20847 transitions. [2020-04-17 18:37:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 18:37:49,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-17 18:37:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:49,536 INFO L225 Difference]: With dead ends: 6394 [2020-04-17 18:37:49,536 INFO L226 Difference]: Without dead ends: 6394 [2020-04-17 18:37:49,536 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2020-04-17 18:37:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2020-04-17 18:37:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 5260. [2020-04-17 18:37:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2020-04-17 18:37:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 17008 transitions. [2020-04-17 18:37:49,608 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 17008 transitions. Word has length 27 [2020-04-17 18:37:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:49,608 INFO L479 AbstractCegarLoop]: Abstraction has 5260 states and 17008 transitions. [2020-04-17 18:37:49,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 18:37:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 17008 transitions. [2020-04-17 18:37:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:49,612 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:49,612 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 18:37:49,612 INFO L427 AbstractCegarLoop]: === Iteration 63 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1303722437, now seen corresponding path program 9 times [2020-04-17 18:37:49,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:49,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266553664] [2020-04-17 18:37:49,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:50,540 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 18:37:50,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266553664] [2020-04-17 18:37:50,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:50,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 18:37:50,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228220498] [2020-04-17 18:37:50,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 18:37:50,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 18:37:50,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-04-17 18:37:50,542 INFO L87 Difference]: Start difference. First operand 5260 states and 17008 transitions. Second operand 18 states. [2020-04-17 18:37:52,755 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-04-17 18:37:53,222 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-04-17 18:37:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:54,385 INFO L93 Difference]: Finished difference Result 5965 states and 19255 transitions. [2020-04-17 18:37:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-17 18:37:54,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-17 18:37:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:54,395 INFO L225 Difference]: With dead ends: 5965 [2020-04-17 18:37:54,395 INFO L226 Difference]: Without dead ends: 5965 [2020-04-17 18:37:54,395 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2020-04-17 18:37:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-04-17 18:37:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 4250. [2020-04-17 18:37:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4250 states. [2020-04-17 18:37:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 13649 transitions. [2020-04-17 18:37:54,504 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 13649 transitions. Word has length 27 [2020-04-17 18:37:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:54,504 INFO L479 AbstractCegarLoop]: Abstraction has 4250 states and 13649 transitions. [2020-04-17 18:37:54,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 18:37:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 13649 transitions. [2020-04-17 18:37:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:54,507 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:54,507 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 18:37:54,507 INFO L427 AbstractCegarLoop]: === Iteration 64 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 147907303, now seen corresponding path program 12 times [2020-04-17 18:37:54,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:54,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802734774] [2020-04-17 18:37:54,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:55,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 18:37:55,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802734774] [2020-04-17 18:37:55,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:55,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-04-17 18:37:55,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452426496] [2020-04-17 18:37:55,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-17 18:37:55,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:55,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-17 18:37:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2020-04-17 18:37:55,472 INFO L87 Difference]: Start difference. First operand 4250 states and 13649 transitions. Second operand 18 states. [2020-04-17 18:37:57,645 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-17 18:37:57,817 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-04-17 18:37:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:37:58,949 INFO L93 Difference]: Finished difference Result 6174 states and 20020 transitions. [2020-04-17 18:37:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 18:37:58,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2020-04-17 18:37:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:37:58,959 INFO L225 Difference]: With dead ends: 6174 [2020-04-17 18:37:58,959 INFO L226 Difference]: Without dead ends: 6174 [2020-04-17 18:37:58,959 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2020-04-17 18:37:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2020-04-17 18:37:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 4110. [2020-04-17 18:37:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2020-04-17 18:37:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 13209 transitions. [2020-04-17 18:37:59,022 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 13209 transitions. Word has length 27 [2020-04-17 18:37:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:37:59,023 INFO L479 AbstractCegarLoop]: Abstraction has 4110 states and 13209 transitions. [2020-04-17 18:37:59,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-17 18:37:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 13209 transitions. [2020-04-17 18:37:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:37:59,027 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:37:59,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] [2020-04-17 18:37:59,027 INFO L427 AbstractCegarLoop]: === Iteration 65 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:37:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:37:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash -650922841, now seen corresponding path program 13 times [2020-04-17 18:37:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:37:59,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273550814] [2020-04-17 18:37:59,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:37:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:37:59,535 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2020-04-17 18:37:59,803 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 18:37:59,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273550814] [2020-04-17 18:37:59,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:37:59,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:37:59,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674660722] [2020-04-17 18:37:59,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:37:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:37:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:37:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:37:59,805 INFO L87 Difference]: Start difference. First operand 4110 states and 13209 transitions. Second operand 16 states. [2020-04-17 18:38:01,152 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 18:38:01,286 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2020-04-17 18:38:01,615 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2020-04-17 18:38:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:38:04,037 INFO L93 Difference]: Finished difference Result 7725 states and 25144 transitions. [2020-04-17 18:38:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 18:38:04,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:38:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:38:04,049 INFO L225 Difference]: With dead ends: 7725 [2020-04-17 18:38:04,050 INFO L226 Difference]: Without dead ends: 7725 [2020-04-17 18:38:04,050 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:38:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2020-04-17 18:38:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 4972. [2020-04-17 18:38:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4972 states. [2020-04-17 18:38:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 16115 transitions. [2020-04-17 18:38:04,127 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 16115 transitions. Word has length 27 [2020-04-17 18:38:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:38:04,127 INFO L479 AbstractCegarLoop]: Abstraction has 4972 states and 16115 transitions. [2020-04-17 18:38:04,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:38:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 16115 transitions. [2020-04-17 18:38:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-17 18:38:04,131 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:38:04,131 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 18:38:04,131 INFO L427 AbstractCegarLoop]: === Iteration 66 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:38:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:38:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash -650922847, now seen corresponding path program 10 times [2020-04-17 18:38:04,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:38:04,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568938631] [2020-04-17 18:38:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:38:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:38:04,874 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 18:38:04,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568938631] [2020-04-17 18:38:04,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:38:04,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-04-17 18:38:04,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310511177] [2020-04-17 18:38:04,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-04-17 18:38:04,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:38:04,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-17 18:38:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-04-17 18:38:04,876 INFO L87 Difference]: Start difference. First operand 4972 states and 16115 transitions. Second operand 16 states. [2020-04-17 18:38:06,227 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-04-17 18:38:06,645 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2020-04-17 18:38:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:38:08,909 INFO L93 Difference]: Finished difference Result 7632 states and 24797 transitions. [2020-04-17 18:38:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-04-17 18:38:08,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-04-17 18:38:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:38:08,921 INFO L225 Difference]: With dead ends: 7632 [2020-04-17 18:38:08,921 INFO L226 Difference]: Without dead ends: 7632 [2020-04-17 18:38:08,921 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2020-04-17 18:38:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2020-04-17 18:38:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 4123. [2020-04-17 18:38:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2020-04-17 18:38:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 13250 transitions. [2020-04-17 18:38:08,985 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 13250 transitions. Word has length 27 [2020-04-17 18:38:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-17 18:38:08,985 INFO L479 AbstractCegarLoop]: Abstraction has 4123 states and 13250 transitions. [2020-04-17 18:38:08,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-04-17 18:38:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 13250 transitions. [2020-04-17 18:38:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-04-17 18:38:08,988 INFO L417 BasicCegarLoop]: Found error trace [2020-04-17 18:38:08,988 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 18:38:08,988 INFO L427 AbstractCegarLoop]: === Iteration 67 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-17 18:38:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-17 18:38:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash 810739445, now seen corresponding path program 1 times [2020-04-17 18:38:08,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-17 18:38:08,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445597141] [2020-04-17 18:38:08,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-17 18:38:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-17 18:38:09,361 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 18:38:09,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445597141] [2020-04-17 18:38:09,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-17 18:38:09,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-17 18:38:09,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036128664] [2020-04-17 18:38:09,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-17 18:38:09,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-04-17 18:38:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-17 18:38:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-17 18:38:09,363 INFO L87 Difference]: Start difference. First operand 4123 states and 13250 transitions. Second operand 13 states. [2020-04-17 18:38:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-17 18:38:10,794 INFO L93 Difference]: Finished difference Result 11841 states and 38332 transitions. [2020-04-17 18:38:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-04-17 18:38:10,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-04-17 18:38:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-17 18:38:10,813 INFO L225 Difference]: With dead ends: 11841 [2020-04-17 18:38:10,813 INFO L226 Difference]: Without dead ends: 11841 [2020-04-17 18:38:10,813 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 Received shutdown request... [2020-04-17 18:38:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-04-17 18:38:10,833 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-17 18:38:10,835 WARN L228 ceAbstractionStarter]: Timeout [2020-04-17 18:38:10,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.04 06:38:10 BasicIcfg [2020-04-17 18:38:10,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-17 18:38:10,837 INFO L168 Benchmark]: Toolchain (without parser) took 238286.64 ms. Allocated memory was 146.8 MB in the beginning and 1.1 GB in the end (delta: 966.3 MB). Free memory was 102.6 MB in the beginning and 648.9 MB in the end (delta: -546.3 MB). Peak memory consumption was 419.9 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,837 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-04-17 18:38:10,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 926.97 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 124.7 MB in the end (delta: -24.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.98 ms. Allocated memory is still 205.0 MB. Free memory was 124.7 MB in the beginning and 121.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,838 INFO L168 Benchmark]: Boogie Preprocessor took 42.57 ms. Allocated memory is still 205.0 MB. Free memory was 121.8 MB in the beginning and 119.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,839 INFO L168 Benchmark]: RCFGBuilder took 760.62 ms. Allocated memory was 205.0 MB in the beginning and 235.9 MB in the end (delta: 30.9 MB). Free memory was 119.8 MB in the beginning and 189.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,840 INFO L168 Benchmark]: TraceAbstraction took 236424.61 ms. Allocated memory was 235.9 MB in the beginning and 1.1 GB in the end (delta: 877.1 MB). Free memory was 189.2 MB in the beginning and 648.9 MB in the end (delta: -459.7 MB). Peak memory consumption was 417.4 MB. Max. memory is 7.1 GB. [2020-04-17 18:38:10,841 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.50 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 926.97 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 124.7 MB in the end (delta: -24.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 105.98 ms. Allocated memory is still 205.0 MB. Free memory was 124.7 MB in the beginning and 121.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.57 ms. Allocated memory is still 205.0 MB. Free memory was 121.8 MB in the beginning and 119.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.62 ms. Allocated memory was 205.0 MB in the beginning and 235.9 MB in the end (delta: 30.9 MB). Free memory was 119.8 MB in the beginning and 189.2 MB in the end (delta: -69.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236424.61 ms. Allocated memory was 235.9 MB in the beginning and 1.1 GB in the end (delta: 877.1 MB). Free memory was 189.2 MB in the beginning and 648.9 MB in the end (delta: -459.7 MB). Peak memory consumption was 417.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 189 ProgramPointsBefore, 60 ProgramPointsAfterwards, 201 TransitionsBefore, 65 TransitionsAfterwards, 16584 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 7 ChoiceCompositions, 8663 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 267 SemBasedMoverChecksPositive, 138 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 27423 CheckedPairsTotal, 166 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1049). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1054). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1053). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1050). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 236.2s, OverallIterations: 67, TraceHistogramMax: 1, AutomataDifference: 182.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 4199 SDtfs, 17319 SDslu, 17643 SDs, 0 SdLazy, 103863 SolverSat, 1532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 104.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1684 GetRequests, 46 SyntacticMatches, 39 SemanticMatches, 1599 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5137 ImplicationChecksByTransitivity, 96.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5986occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 67 MinimizatonAttempts, 80260 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 1728 NumberOfCodeBlocks, 1728 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1661 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 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