/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-wmm/mix024_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:54:46,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:54:46,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:54:46,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:54:46,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:54:46,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:54:46,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:54:46,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:54:46,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:54:46,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:54:46,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:54:46,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:54:46,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:54:46,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:54:46,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:54:46,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:54:46,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:54:46,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:54:46,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:54:46,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:54:46,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:54:46,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:54:46,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:54:46,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:54:46,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:54:46,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:54:46,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:54:46,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:54:46,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:54:46,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:54:46,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:54:46,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:54:46,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:54:46,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:54:46,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:54:46,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:54:46,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:54:46,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:54:46,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:54:46,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:54:46,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:54:46,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:54:46,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:54:46,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:54:46,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:54:46,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:54:46,331 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:54:46,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:54:46,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:54:46,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:54:46,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:54:46,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:54:46,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:54:46,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:54:46,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:54:46,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:54:46,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:54:46,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:54:46,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:54:46,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:54:46,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:54:46,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:54:46,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:54:46,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:54:46,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:54:46,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:54:46,619 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:54:46,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-18 12:54:46,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a04cbcd0/112bcbbdfd0f469b97e4fbeae3c3578e/FLAG6e8669f2c [2019-12-18 12:54:47,227 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:54:47,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-18 12:54:47,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a04cbcd0/112bcbbdfd0f469b97e4fbeae3c3578e/FLAG6e8669f2c [2019-12-18 12:54:47,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a04cbcd0/112bcbbdfd0f469b97e4fbeae3c3578e [2019-12-18 12:54:47,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:54:47,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:54:47,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:47,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:54:47,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:54:47,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:47" (1/1) ... [2019-12-18 12:54:47,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c14d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:47, skipping insertion in model container [2019-12-18 12:54:47,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:47" (1/1) ... [2019-12-18 12:54:47,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:54:47,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:54:48,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:48,190 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:54:48,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:48,360 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:54:48,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48 WrapperNode [2019-12-18 12:54:48,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:48,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:48,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:54:48,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:54:48,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:48,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:54:48,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:54:48,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:54:48,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... [2019-12-18 12:54:48,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:54:48,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:54:48,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:54:48,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:54:48,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:54:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:54:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:54:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:54:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:54:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:54:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:54:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:54:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:54:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:54:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:54:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:54:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:54:48,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:54:48,541 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:54:49,461 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:54:49,462 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:54:49,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:49 BoogieIcfgContainer [2019-12-18 12:54:49,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:54:49,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:54:49,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:54:49,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:54:49,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:54:47" (1/3) ... [2019-12-18 12:54:49,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a99d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:49, skipping insertion in model container [2019-12-18 12:54:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:48" (2/3) ... [2019-12-18 12:54:49,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a99d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:49, skipping insertion in model container [2019-12-18 12:54:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:49" (3/3) ... [2019-12-18 12:54:49,472 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.oepc.i [2019-12-18 12:54:49,483 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:54:49,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:54:49,492 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:54:49,493 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:54:49,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:49,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:54:49,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:54:49,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:54:49,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:54:49,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:54:49,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:54:49,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:54:49,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:54:49,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:54:49,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:54:49,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:49,835 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:49,836 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:49,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:54:49,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:49,961 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:49,961 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:49,972 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:54:49,998 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:54:49,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:54:55,111 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-18 12:54:55,287 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 12:54:55,726 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:54:55,868 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:54:55,889 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 12:54:55,890 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 12:54:55,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:55:15,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 12:55:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 12:55:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:55:15,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:15,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:55:15,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 12:55:15,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:15,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083759295] [2019-12-18 12:55:15,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:15,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083759295] [2019-12-18 12:55:15,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:15,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:55:15,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621446955] [2019-12-18 12:55:15,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:15,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:15,629 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 12:55:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:17,359 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 12:55:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:17,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:55:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,036 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 12:55:18,037 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 12:55:18,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 12:55:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 12:55:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 12:55:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 12:55:32,049 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 12:55:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 12:55:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 12:55:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:55:32,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:32,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:32,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 12:55:32,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:32,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424249869] [2019-12-18 12:55:32,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:32,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424249869] [2019-12-18 12:55:32,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:32,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:32,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010445623] [2019-12-18 12:55:32,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:32,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:32,161 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 12:55:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:37,748 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 12:55:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:37,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:55:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:38,377 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 12:55:38,377 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 12:55:38,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 12:55:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 12:55:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 12:55:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 12:55:54,224 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 12:55:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:54,224 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 12:55:54,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 12:55:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:55:54,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:54,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:54,232 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 12:55:54,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:54,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330235189] [2019-12-18 12:55:54,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:54,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330235189] [2019-12-18 12:55:54,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:54,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:54,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719674268] [2019-12-18 12:55:54,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:54,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:54,325 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 12:55:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:54,457 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 12:55:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:54,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:55:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:54,515 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 12:55:54,516 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 12:55:54,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 12:55:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 12:55:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 12:55:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 12:55:55,196 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 12:55:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:55,196 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 12:55:55,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 12:55:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:55:55,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:55,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:55,201 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 12:55:55,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:55,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816202668] [2019-12-18 12:55:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:55,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816202668] [2019-12-18 12:55:55,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:55,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:55,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353800697] [2019-12-18 12:55:55,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:55,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:55,324 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 12:55:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:55,811 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 12:55:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:55:55,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:55:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:55,915 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 12:55:55,915 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 12:55:55,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 12:55:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 12:55:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 12:55:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 12:55:57,527 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 12:55:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:57,529 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 12:55:57,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 12:55:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:55:57,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:57,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:57,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 12:55:57,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:57,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732908013] [2019-12-18 12:55:57,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:57,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732908013] [2019-12-18 12:55:57,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:57,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:57,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715654644] [2019-12-18 12:55:57,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:57,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:57,661 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 12:55:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:58,682 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 12:55:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:58,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:55:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:58,775 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 12:55:58,775 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 12:55:58,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 12:55:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 12:55:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 12:55:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 12:55:59,965 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 12:55:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:59,965 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 12:55:59,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 12:55:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:55:59,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:59,978 INFO L411 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] [2019-12-18 12:55:59,978 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 12:55:59,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:59,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636618802] [2019-12-18 12:55:59,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:00,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636618802] [2019-12-18 12:56:00,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:00,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:00,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854443950] [2019-12-18 12:56:00,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:00,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:00,038 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 12:56:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:00,103 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 12:56:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:56:00,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:56:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:00,127 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 12:56:00,127 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 12:56:00,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 12:56:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 12:56:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 12:56:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 12:56:00,360 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 12:56:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:00,360 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 12:56:00,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 12:56:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:56:00,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:00,372 INFO L411 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] [2019-12-18 12:56:00,372 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 12:56:00,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:00,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452862972] [2019-12-18 12:56:00,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:00,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452862972] [2019-12-18 12:56:00,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:00,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:56:00,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778182679] [2019-12-18 12:56:00,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:56:00,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:56:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:56:00,496 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 12:56:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:01,526 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 12:56:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:56:01,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:56:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:01,561 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 12:56:01,561 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 12:56:01,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:56:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 12:56:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 12:56:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 12:56:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 12:56:01,863 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 12:56:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:01,863 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 12:56:01,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:56:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 12:56:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:56:01,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:01,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:01,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 12:56:01,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:01,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839593631] [2019-12-18 12:56:01,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:02,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839593631] [2019-12-18 12:56:02,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:02,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:56:02,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931830251] [2019-12-18 12:56:02,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:02,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:02,018 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 12:56:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:03,186 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 12:56:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:56:03,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:56:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:03,224 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 12:56:03,224 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 12:56:03,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:56:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 12:56:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 12:56:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 12:56:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 12:56:03,542 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 12:56:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:03,543 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 12:56:03,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 12:56:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:56:03,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:03,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:03,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 12:56:03,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:03,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833290621] [2019-12-18 12:56:03,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:03,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833290621] [2019-12-18 12:56:03,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:03,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:03,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374157801] [2019-12-18 12:56:03,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:03,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:03,634 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 12:56:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:03,770 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 12:56:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:03,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:56:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:03,804 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 12:56:03,804 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 12:56:03,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 12:56:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 12:56:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 12:56:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 12:56:04,403 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 12:56:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:04,403 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 12:56:04,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 12:56:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:56:04,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:04,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:04,428 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 12:56:04,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:04,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737649857] [2019-12-18 12:56:04,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:04,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737649857] [2019-12-18 12:56:04,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:04,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:04,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678793403] [2019-12-18 12:56:04,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:04,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:04,494 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 12:56:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:04,595 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 12:56:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:56:04,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:56:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:04,614 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 12:56:04,614 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 12:56:04,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 12:56:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 12:56:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 12:56:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 12:56:04,788 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 12:56:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:04,789 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 12:56:04,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 12:56:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:56:04,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:04,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:04,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 12:56:04,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:04,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862917177] [2019-12-18 12:56:04,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:04,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862917177] [2019-12-18 12:56:04,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:04,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:56:04,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783713305] [2019-12-18 12:56:04,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:04,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:04,866 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 12:56:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:04,917 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 12:56:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:56:04,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:56:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:04,928 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 12:56:04,928 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 12:56:04,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 12:56:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 12:56:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 12:56:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 12:56:05,035 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 12:56:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:05,035 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 12:56:05,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 12:56:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:05,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:05,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:05,043 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 12:56:05,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:05,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406634852] [2019-12-18 12:56:05,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:05,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406634852] [2019-12-18 12:56:05,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:05,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:05,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726150756] [2019-12-18 12:56:05,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:05,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:05,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:05,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:05,107 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 12:56:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:05,196 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 12:56:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:05,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:56:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:05,214 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 12:56:05,214 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 12:56:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 12:56:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 12:56:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 12:56:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 12:56:05,379 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 12:56:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:05,380 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 12:56:05,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 12:56:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:05,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:05,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:05,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 12:56:05,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:05,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101748121] [2019-12-18 12:56:05,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:05,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101748121] [2019-12-18 12:56:05,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:05,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:05,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539005076] [2019-12-18 12:56:05,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:05,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:05,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:05,505 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 12:56:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:05,780 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 12:56:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:56:05,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:56:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:05,804 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 12:56:05,805 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 12:56:05,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:56:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 12:56:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 12:56:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 12:56:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 12:56:06,012 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 12:56:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:06,013 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 12:56:06,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 12:56:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:06,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:06,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:06,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 12:56:06,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:06,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869669401] [2019-12-18 12:56:06,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:06,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869669401] [2019-12-18 12:56:06,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:06,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:06,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563862985] [2019-12-18 12:56:06,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:06,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:06,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:06,121 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 12:56:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:06,678 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 12:56:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:56:06,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:56:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:06,699 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:56:06,699 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 12:56:06,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:56:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 12:56:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 12:56:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 12:56:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 12:56:06,875 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 12:56:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:06,876 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 12:56:06,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 12:56:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:06,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:06,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:06,887 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 12:56:06,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:06,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363274925] [2019-12-18 12:56:06,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:07,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363274925] [2019-12-18 12:56:07,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:07,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:56:07,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408139422] [2019-12-18 12:56:07,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:07,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:07,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:07,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:07,013 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 12:56:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:08,217 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 12:56:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:56:08,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:56:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:08,280 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 12:56:08,280 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 12:56:08,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:56:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 12:56:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 12:56:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 12:56:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 12:56:08,666 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 12:56:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:08,667 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 12:56:08,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:56:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 12:56:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:08,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:08,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:08,683 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 12:56:08,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:08,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58327956] [2019-12-18 12:56:08,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58327956] [2019-12-18 12:56:08,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:08,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317577203] [2019-12-18 12:56:08,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:08,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:08,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:08,738 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 12:56:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:08,811 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 12:56:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:08,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:56:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:08,835 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 12:56:08,835 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 12:56:08,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 12:56:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 12:56:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 12:56:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 12:56:09,040 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 12:56:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 12:56:09,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 12:56:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:09,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:09,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:09,058 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 12:56:09,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:09,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315650058] [2019-12-18 12:56:09,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:09,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315650058] [2019-12-18 12:56:09,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:09,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:56:09,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129983209] [2019-12-18 12:56:09,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:09,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:09,162 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 12:56:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:10,413 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 12:56:10,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:56:10,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:56:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:10,453 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 12:56:10,453 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 12:56:10,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:56:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 12:56:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 12:56:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 12:56:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 12:56:10,713 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 12:56:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:10,714 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 12:56:10,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:56:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 12:56:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:10,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:10,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:10,724 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 12:56:10,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:10,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491052332] [2019-12-18 12:56:10,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:10,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491052332] [2019-12-18 12:56:10,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:10,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:56:10,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020920892] [2019-12-18 12:56:10,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:56:10,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:56:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:56:10,812 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-18 12:56:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:11,134 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-18 12:56:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:56:11,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 12:56:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:11,153 INFO L225 Difference]: With dead ends: 12384 [2019-12-18 12:56:11,153 INFO L226 Difference]: Without dead ends: 12384 [2019-12-18 12:56:11,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:56:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-18 12:56:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-18 12:56:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-18 12:56:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-18 12:56:11,331 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-18 12:56:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:11,332 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-18 12:56:11,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:56:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-18 12:56:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:11,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:11,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:11,345 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-18 12:56:11,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:11,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985734464] [2019-12-18 12:56:11,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:11,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985734464] [2019-12-18 12:56:11,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:11,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:56:11,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141666276] [2019-12-18 12:56:11,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:11,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:11,463 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-18 12:56:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:12,369 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-18 12:56:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:56:12,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:56:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:12,396 INFO L225 Difference]: With dead ends: 20495 [2019-12-18 12:56:12,397 INFO L226 Difference]: Without dead ends: 20327 [2019-12-18 12:56:12,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:56:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-18 12:56:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-18 12:56:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-18 12:56:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-18 12:56:12,663 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-18 12:56:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:12,663 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-18 12:56:12,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-18 12:56:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:12,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:12,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:12,680 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-18 12:56:12,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:12,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8614018] [2019-12-18 12:56:12,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8614018] [2019-12-18 12:56:12,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:12,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039759562] [2019-12-18 12:56:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:56:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:56:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:56:12,773 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-18 12:56:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:13,986 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-18 12:56:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:56:13,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 12:56:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:14,061 INFO L225 Difference]: With dead ends: 30832 [2019-12-18 12:56:14,062 INFO L226 Difference]: Without dead ends: 30612 [2019-12-18 12:56:14,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:56:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-18 12:56:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-18 12:56:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-18 12:56:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-18 12:56:14,609 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-18 12:56:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:14,609 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-18 12:56:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:56:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-18 12:56:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:14,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:14,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:14,634 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-18 12:56:14,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:14,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931229786] [2019-12-18 12:56:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:14,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931229786] [2019-12-18 12:56:14,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:14,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:56:14,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883737164] [2019-12-18 12:56:14,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:56:14,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:56:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:56:14,736 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 6 states. [2019-12-18 12:56:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:15,422 INFO L93 Difference]: Finished difference Result 26232 states and 77397 transitions. [2019-12-18 12:56:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:56:15,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 12:56:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:15,464 INFO L225 Difference]: With dead ends: 26232 [2019-12-18 12:56:15,464 INFO L226 Difference]: Without dead ends: 26232 [2019-12-18 12:56:15,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:56:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2019-12-18 12:56:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 23702. [2019-12-18 12:56:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23702 states. [2019-12-18 12:56:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 70494 transitions. [2019-12-18 12:56:15,869 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 70494 transitions. Word has length 64 [2019-12-18 12:56:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 23702 states and 70494 transitions. [2019-12-18 12:56:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:56:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 70494 transitions. [2019-12-18 12:56:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:56:15,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:15,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:15,897 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 9 times [2019-12-18 12:56:15,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:15,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480089376] [2019-12-18 12:56:15,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:15,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480089376] [2019-12-18 12:56:15,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:15,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:15,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487099594] [2019-12-18 12:56:15,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:15,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:15,965 INFO L87 Difference]: Start difference. First operand 23702 states and 70494 transitions. Second operand 3 states. [2019-12-18 12:56:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:16,069 INFO L93 Difference]: Finished difference Result 23702 states and 70493 transitions. [2019-12-18 12:56:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:56:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:16,507 INFO L225 Difference]: With dead ends: 23702 [2019-12-18 12:56:16,507 INFO L226 Difference]: Without dead ends: 23702 [2019-12-18 12:56:16,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23702 states. [2019-12-18 12:56:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23702 to 20395. [2019-12-18 12:56:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20395 states. [2019-12-18 12:56:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20395 states to 20395 states and 61323 transitions. [2019-12-18 12:56:17,075 INFO L78 Accepts]: Start accepts. Automaton has 20395 states and 61323 transitions. Word has length 64 [2019-12-18 12:56:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:17,075 INFO L462 AbstractCegarLoop]: Abstraction has 20395 states and 61323 transitions. [2019-12-18 12:56:17,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20395 states and 61323 transitions. [2019-12-18 12:56:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:56:17,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:17,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:17,113 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-18 12:56:17,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:17,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654113235] [2019-12-18 12:56:17,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:17,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654113235] [2019-12-18 12:56:17,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:17,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:56:17,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631108715] [2019-12-18 12:56:17,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:56:17,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:56:17,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:56:17,280 INFO L87 Difference]: Start difference. First operand 20395 states and 61323 transitions. Second operand 7 states. [2019-12-18 12:56:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:18,102 INFO L93 Difference]: Finished difference Result 26332 states and 77690 transitions. [2019-12-18 12:56:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:56:18,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:56:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:18,153 INFO L225 Difference]: With dead ends: 26332 [2019-12-18 12:56:18,153 INFO L226 Difference]: Without dead ends: 26092 [2019-12-18 12:56:18,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:56:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26092 states. [2019-12-18 12:56:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26092 to 21025. [2019-12-18 12:56:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21025 states. [2019-12-18 12:56:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 63024 transitions. [2019-12-18 12:56:18,539 INFO L78 Accepts]: Start accepts. Automaton has 21025 states and 63024 transitions. Word has length 65 [2019-12-18 12:56:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:18,540 INFO L462 AbstractCegarLoop]: Abstraction has 21025 states and 63024 transitions. [2019-12-18 12:56:18,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:56:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21025 states and 63024 transitions. [2019-12-18 12:56:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:56:18,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:18,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:18,565 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 2 times [2019-12-18 12:56:18,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:18,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385063527] [2019-12-18 12:56:18,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:18,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385063527] [2019-12-18 12:56:18,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:56:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413170230] [2019-12-18 12:56:18,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:56:18,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:18,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:56:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:18,633 INFO L87 Difference]: Start difference. First operand 21025 states and 63024 transitions. Second operand 3 states. [2019-12-18 12:56:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:18,699 INFO L93 Difference]: Finished difference Result 14552 states and 43201 transitions. [2019-12-18 12:56:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:18,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:56:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:18,724 INFO L225 Difference]: With dead ends: 14552 [2019-12-18 12:56:18,724 INFO L226 Difference]: Without dead ends: 14552 [2019-12-18 12:56:18,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:56:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14552 states. [2019-12-18 12:56:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14552 to 14345. [2019-12-18 12:56:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14345 states. [2019-12-18 12:56:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 42613 transitions. [2019-12-18 12:56:18,968 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 42613 transitions. Word has length 65 [2019-12-18 12:56:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:18,968 INFO L462 AbstractCegarLoop]: Abstraction has 14345 states and 42613 transitions. [2019-12-18 12:56:18,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:56:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 42613 transitions. [2019-12-18 12:56:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:18,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:18,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:18,984 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:18,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-18 12:56:18,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:18,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013343427] [2019-12-18 12:56:18,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:19,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013343427] [2019-12-18 12:56:19,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:19,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:56:19,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677887514] [2019-12-18 12:56:19,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:56:19,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:56:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:56:19,081 INFO L87 Difference]: Start difference. First operand 14345 states and 42613 transitions. Second operand 8 states. [2019-12-18 12:56:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:20,190 INFO L93 Difference]: Finished difference Result 25482 states and 74721 transitions. [2019-12-18 12:56:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:56:20,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:56:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:20,216 INFO L225 Difference]: With dead ends: 25482 [2019-12-18 12:56:20,216 INFO L226 Difference]: Without dead ends: 18758 [2019-12-18 12:56:20,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:56:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-12-18 12:56:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 15008. [2019-12-18 12:56:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-12-18 12:56:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 44099 transitions. [2019-12-18 12:56:20,458 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 44099 transitions. Word has length 66 [2019-12-18 12:56:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:20,459 INFO L462 AbstractCegarLoop]: Abstraction has 15008 states and 44099 transitions. [2019-12-18 12:56:20,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:56:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 44099 transitions. [2019-12-18 12:56:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:20,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:20,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:20,474 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-18 12:56:20,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:20,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901815012] [2019-12-18 12:56:20,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:20,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901815012] [2019-12-18 12:56:20,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:20,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:56:20,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073558468] [2019-12-18 12:56:20,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:56:20,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:56:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:56:20,593 INFO L87 Difference]: Start difference. First operand 15008 states and 44099 transitions. Second operand 9 states. [2019-12-18 12:56:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:21,552 INFO L93 Difference]: Finished difference Result 24021 states and 69932 transitions. [2019-12-18 12:56:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:56:21,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:56:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:21,577 INFO L225 Difference]: With dead ends: 24021 [2019-12-18 12:56:21,577 INFO L226 Difference]: Without dead ends: 17577 [2019-12-18 12:56:21,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:56:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-18 12:56:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 14770. [2019-12-18 12:56:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14770 states. [2019-12-18 12:56:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14770 states to 14770 states and 43349 transitions. [2019-12-18 12:56:21,818 INFO L78 Accepts]: Start accepts. Automaton has 14770 states and 43349 transitions. Word has length 66 [2019-12-18 12:56:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:21,818 INFO L462 AbstractCegarLoop]: Abstraction has 14770 states and 43349 transitions. [2019-12-18 12:56:21,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:56:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14770 states and 43349 transitions. [2019-12-18 12:56:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:21,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:21,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:21,832 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-18 12:56:21,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:21,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775017664] [2019-12-18 12:56:21,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:22,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775017664] [2019-12-18 12:56:22,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:22,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:56:22,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564066170] [2019-12-18 12:56:22,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:56:22,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:56:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:56:22,004 INFO L87 Difference]: Start difference. First operand 14770 states and 43349 transitions. Second operand 10 states. [2019-12-18 12:56:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:23,748 INFO L93 Difference]: Finished difference Result 25274 states and 72784 transitions. [2019-12-18 12:56:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:56:23,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:56:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:23,783 INFO L225 Difference]: With dead ends: 25274 [2019-12-18 12:56:23,783 INFO L226 Difference]: Without dead ends: 25274 [2019-12-18 12:56:23,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:56:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2019-12-18 12:56:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 16246. [2019-12-18 12:56:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-12-18 12:56:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 47556 transitions. [2019-12-18 12:56:24,496 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 47556 transitions. Word has length 66 [2019-12-18 12:56:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:24,496 INFO L462 AbstractCegarLoop]: Abstraction has 16246 states and 47556 transitions. [2019-12-18 12:56:24,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:56:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 47556 transitions. [2019-12-18 12:56:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:24,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:24,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:24,513 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-18 12:56:24,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:24,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904253259] [2019-12-18 12:56:24,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:24,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904253259] [2019-12-18 12:56:24,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:24,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:56:24,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66113949] [2019-12-18 12:56:24,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:56:24,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:56:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:56:24,704 INFO L87 Difference]: Start difference. First operand 16246 states and 47556 transitions. Second operand 11 states. [2019-12-18 12:56:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:26,411 INFO L93 Difference]: Finished difference Result 24229 states and 69793 transitions. [2019-12-18 12:56:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:56:26,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:56:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:26,445 INFO L225 Difference]: With dead ends: 24229 [2019-12-18 12:56:26,445 INFO L226 Difference]: Without dead ends: 24229 [2019-12-18 12:56:26,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:56:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24229 states. [2019-12-18 12:56:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24229 to 16318. [2019-12-18 12:56:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16318 states. [2019-12-18 12:56:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16318 states to 16318 states and 47756 transitions. [2019-12-18 12:56:26,744 INFO L78 Accepts]: Start accepts. Automaton has 16318 states and 47756 transitions. Word has length 66 [2019-12-18 12:56:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:26,744 INFO L462 AbstractCegarLoop]: Abstraction has 16318 states and 47756 transitions. [2019-12-18 12:56:26,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:56:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 16318 states and 47756 transitions. [2019-12-18 12:56:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:26,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:26,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:26,762 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash 150910970, now seen corresponding path program 5 times [2019-12-18 12:56:26,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:26,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221827063] [2019-12-18 12:56:26,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:26,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221827063] [2019-12-18 12:56:26,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:26,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:56:26,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215831125] [2019-12-18 12:56:26,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:56:26,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:56:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:56:26,923 INFO L87 Difference]: Start difference. First operand 16318 states and 47756 transitions. Second operand 11 states. [2019-12-18 12:56:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:28,809 INFO L93 Difference]: Finished difference Result 25237 states and 72487 transitions. [2019-12-18 12:56:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:56:28,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:56:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:28,844 INFO L225 Difference]: With dead ends: 25237 [2019-12-18 12:56:28,844 INFO L226 Difference]: Without dead ends: 25237 [2019-12-18 12:56:28,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:56:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-12-18 12:56:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 15766. [2019-12-18 12:56:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-18 12:56:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46172 transitions. [2019-12-18 12:56:29,142 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46172 transitions. Word has length 66 [2019-12-18 12:56:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:29,142 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46172 transitions. [2019-12-18 12:56:29,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:56:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46172 transitions. [2019-12-18 12:56:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:29,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:29,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:29,158 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-18 12:56:29,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:29,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198241943] [2019-12-18 12:56:29,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:29,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198241943] [2019-12-18 12:56:29,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:29,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:56:29,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963981267] [2019-12-18 12:56:29,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:56:29,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:56:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:56:29,336 INFO L87 Difference]: Start difference. First operand 15766 states and 46172 transitions. Second operand 11 states. [2019-12-18 12:56:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:30,460 INFO L93 Difference]: Finished difference Result 23147 states and 66955 transitions. [2019-12-18 12:56:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:56:30,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:56:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:30,484 INFO L225 Difference]: With dead ends: 23147 [2019-12-18 12:56:30,484 INFO L226 Difference]: Without dead ends: 18005 [2019-12-18 12:56:30,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:56:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2019-12-18 12:56:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 15208. [2019-12-18 12:56:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 12:56:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44534 transitions. [2019-12-18 12:56:30,723 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44534 transitions. Word has length 66 [2019-12-18 12:56:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:30,724 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44534 transitions. [2019-12-18 12:56:30,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:56:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44534 transitions. [2019-12-18 12:56:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:30,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:30,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:30,738 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 7 times [2019-12-18 12:56:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143650145] [2019-12-18 12:56:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:30,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143650145] [2019-12-18 12:56:30,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:30,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:56:30,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449192583] [2019-12-18 12:56:30,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:56:30,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:56:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:56:30,919 INFO L87 Difference]: Start difference. First operand 15208 states and 44534 transitions. Second operand 10 states. [2019-12-18 12:56:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:33,302 INFO L93 Difference]: Finished difference Result 28214 states and 80972 transitions. [2019-12-18 12:56:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:56:33,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:56:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:33,339 INFO L225 Difference]: With dead ends: 28214 [2019-12-18 12:56:33,339 INFO L226 Difference]: Without dead ends: 28214 [2019-12-18 12:56:33,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:56:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2019-12-18 12:56:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 13004. [2019-12-18 12:56:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13004 states. [2019-12-18 12:56:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 38434 transitions. [2019-12-18 12:56:33,629 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 38434 transitions. Word has length 66 [2019-12-18 12:56:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:33,630 INFO L462 AbstractCegarLoop]: Abstraction has 13004 states and 38434 transitions. [2019-12-18 12:56:33,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:56:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 38434 transitions. [2019-12-18 12:56:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:56:33,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:33,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:33,644 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 8 times [2019-12-18 12:56:33,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:33,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106673061] [2019-12-18 12:56:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:33,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106673061] [2019-12-18 12:56:33,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:33,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:56:33,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46018816] [2019-12-18 12:56:33,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:56:33,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:56:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:33,734 INFO L87 Difference]: Start difference. First operand 13004 states and 38434 transitions. Second operand 4 states. [2019-12-18 12:56:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:33,859 INFO L93 Difference]: Finished difference Result 14948 states and 44329 transitions. [2019-12-18 12:56:33,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:56:33,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:56:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:33,900 INFO L225 Difference]: With dead ends: 14948 [2019-12-18 12:56:33,901 INFO L226 Difference]: Without dead ends: 14948 [2019-12-18 12:56:33,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:56:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2019-12-18 12:56:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 12181. [2019-12-18 12:56:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12181 states. [2019-12-18 12:56:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 36301 transitions. [2019-12-18 12:56:34,229 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 36301 transitions. Word has length 66 [2019-12-18 12:56:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:34,229 INFO L462 AbstractCegarLoop]: Abstraction has 12181 states and 36301 transitions. [2019-12-18 12:56:34,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:56:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 36301 transitions. [2019-12-18 12:56:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:56:34,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:34,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:34,245 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-18 12:56:34,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:34,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873317454] [2019-12-18 12:56:34,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:56:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:56:34,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873317454] [2019-12-18 12:56:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:56:34,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:56:34,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637305627] [2019-12-18 12:56:34,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:56:34,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:56:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:56:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:56:34,426 INFO L87 Difference]: Start difference. First operand 12181 states and 36301 transitions. Second operand 12 states. [2019-12-18 12:56:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:56:35,496 INFO L93 Difference]: Finished difference Result 14914 states and 44027 transitions. [2019-12-18 12:56:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:56:35,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:56:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:56:35,518 INFO L225 Difference]: With dead ends: 14914 [2019-12-18 12:56:35,518 INFO L226 Difference]: Without dead ends: 14493 [2019-12-18 12:56:35,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:56:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-12-18 12:56:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11927. [2019-12-18 12:56:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-18 12:56:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 35657 transitions. [2019-12-18 12:56:35,720 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 35657 transitions. Word has length 67 [2019-12-18 12:56:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:56:35,720 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 35657 transitions. [2019-12-18 12:56:35,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:56:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 35657 transitions. [2019-12-18 12:56:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:56:35,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:56:35,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:56:35,734 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:56:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:56:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-18 12:56:35,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:56:35,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459344723] [2019-12-18 12:56:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:56:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:56:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:56:35,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:56:35,870 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:56:35,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24|) |v_ULTIMATE.start_main_~#t651~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24|)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t651~0.base_24|) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= |v_ULTIMATE.start_main_~#t651~0.offset_19| 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24| 1)) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t651~0.base_24| 4)) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t651~0.offset=|v_ULTIMATE.start_main_~#t651~0.offset_19|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t651~0.base=|v_ULTIMATE.start_main_~#t651~0.base_24|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_20|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t653~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t652~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t651~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t651~0.base, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t653~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:56:35,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t652~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t652~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t652~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10|) |v_ULTIMATE.start_main_~#t652~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t652~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t652~0.base, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:56:35,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t653~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t653~0.base_13| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t653~0.base_13|)) (= |v_ULTIMATE.start_main_~#t653~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13|) |v_ULTIMATE.start_main_~#t653~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t653~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t653~0.base] because there is no mapped edge [2019-12-18 12:56:35,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:56:35,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1503976864 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1503976864 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In1503976864 |P1Thread1of1ForFork2_#t~ite9_Out1503976864|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1503976864| ~a~0_In1503976864) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In1503976864, ~a$w_buff1~0=~a$w_buff1~0_In1503976864, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1503976864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1503976864} OutVars{~a~0=~a~0_In1503976864, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1503976864|, ~a$w_buff1~0=~a$w_buff1~0_In1503976864, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1503976864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1503976864} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:56:35,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In367653006 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In367653006 256)))) (or (and (= ~a$w_buff0_used~0_In367653006 |P0Thread1of1ForFork1_#t~ite5_Out367653006|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out367653006|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In367653006, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In367653006} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out367653006|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In367653006, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In367653006} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:56:35,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1673464243 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1673464243 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1673464243 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1673464243 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1673464243| ~a$w_buff1_used~0_In-1673464243) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1673464243| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1673464243, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1673464243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1673464243, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1673464243} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1673464243|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1673464243, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1673464243, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1673464243, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1673464243} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:56:35,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-767961055 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-767961055 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-767961055) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-767961055 ~a$r_buff0_thd1~0_Out-767961055)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-767961055, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-767961055} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-767961055|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-767961055, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-767961055} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:56:35,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-372024786 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-372024786 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-372024786 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-372024786 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-372024786 |P0Thread1of1ForFork1_#t~ite8_Out-372024786|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-372024786|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-372024786, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-372024786, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-372024786, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-372024786} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-372024786|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-372024786, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-372024786, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-372024786, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-372024786} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:56:35,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:56:35,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-588923915 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-588923915| |P2Thread1of1ForFork0_#t~ite20_Out-588923915|) (= |P2Thread1of1ForFork0_#t~ite21_Out-588923915| ~a$w_buff0~0_In-588923915)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-588923915| ~a$w_buff0~0_In-588923915) (= |P2Thread1of1ForFork0_#t~ite20_Out-588923915| |P2Thread1of1ForFork0_#t~ite21_Out-588923915|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-588923915 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-588923915 256) 0)) (= (mod ~a$w_buff0_used~0_In-588923915 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-588923915 256) 0)))) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-588923915, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-588923915, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-588923915, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-588923915, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-588923915, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-588923915|, ~weak$$choice2~0=~weak$$choice2~0_In-588923915} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-588923915|, ~a$w_buff0~0=~a$w_buff0~0_In-588923915, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-588923915, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-588923915, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-588923915, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-588923915|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-588923915, ~weak$$choice2~0=~weak$$choice2~0_In-588923915} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:56:35,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1038924941 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1038924941 |P2Thread1of1ForFork0_#t~ite26_Out-1038924941|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1038924941| |P2Thread1of1ForFork0_#t~ite26_Out-1038924941|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1038924941 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1038924941 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1038924941 256)) (and (= (mod ~a$w_buff1_used~0_In-1038924941 256) 0) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1038924941| |P2Thread1of1ForFork0_#t~ite26_Out-1038924941|) (= ~a$w_buff0_used~0_In-1038924941 |P2Thread1of1ForFork0_#t~ite27_Out-1038924941|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1038924941|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1038924941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1038924941, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1038924941, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1038924941, ~weak$$choice2~0=~weak$$choice2~0_In-1038924941} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1038924941|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1038924941|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1038924941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1038924941, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1038924941, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1038924941, ~weak$$choice2~0=~weak$$choice2~0_In-1038924941} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:56:35,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1614028779 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1614028779| |P2Thread1of1ForFork0_#t~ite29_Out-1614028779|) (= ~a$w_buff1_used~0_In-1614028779 |P2Thread1of1ForFork0_#t~ite30_Out-1614028779|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1614028779| |P2Thread1of1ForFork0_#t~ite30_Out-1614028779|) (= ~a$w_buff1_used~0_In-1614028779 |P2Thread1of1ForFork0_#t~ite29_Out-1614028779|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1614028779 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1614028779 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1614028779 256))) (= 0 (mod ~a$w_buff0_used~0_In-1614028779 256))))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1614028779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1614028779, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1614028779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1614028779, ~weak$$choice2~0=~weak$$choice2~0_In-1614028779, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1614028779|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1614028779, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1614028779, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1614028779, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1614028779|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1614028779, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1614028779|, ~weak$$choice2~0=~weak$$choice2~0_In-1614028779} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:56:35,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:56:35,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:56:35,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1155519299 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1155519299 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1155519299| ~a$w_buff0_used~0_In-1155519299)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1155519299| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1155519299, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1155519299} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1155519299, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1155519299, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1155519299|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:56:35,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1581513640 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1581513640 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1581513640 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1581513640 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1581513640|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-1581513640| ~a$w_buff1_used~0_In-1581513640)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1581513640, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1581513640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1581513640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1581513640} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1581513640, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1581513640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1581513640, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1581513640|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1581513640} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:56:35,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-705743435 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-705743435 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-705743435 |P1Thread1of1ForFork2_#t~ite13_Out-705743435|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-705743435|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-705743435, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-705743435} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-705743435, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-705743435, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-705743435|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:56:35,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-431455204 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-431455204 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-431455204 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-431455204 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-431455204| ~a$r_buff1_thd2~0_In-431455204)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-431455204|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-431455204, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-431455204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-431455204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-431455204} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-431455204, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-431455204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-431455204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-431455204, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-431455204|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:56:35,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:56:35,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:56:35,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out563910847| |P2Thread1of1ForFork0_#t~ite38_Out563910847|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In563910847 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In563910847 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In563910847 |P2Thread1of1ForFork0_#t~ite38_Out563910847|)) (and .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out563910847| ~a$w_buff1~0_In563910847) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In563910847, ~a$w_buff1~0=~a$w_buff1~0_In563910847, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In563910847, ~a$w_buff1_used~0=~a$w_buff1_used~0_In563910847} OutVars{~a~0=~a~0_In563910847, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out563910847|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out563910847|, ~a$w_buff1~0=~a$w_buff1~0_In563910847, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In563910847, ~a$w_buff1_used~0=~a$w_buff1_used~0_In563910847} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:56:35,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1040180929 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1040180929 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1040180929|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1040180929 |P2Thread1of1ForFork0_#t~ite40_Out1040180929|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1040180929, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1040180929} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1040180929|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1040180929, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1040180929} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:56:35,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1785080789 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1785080789 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1785080789 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1785080789 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1785080789|)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1785080789| ~a$w_buff1_used~0_In-1785080789) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1785080789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1785080789, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1785080789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1785080789} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1785080789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1785080789, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1785080789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1785080789, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1785080789|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:56:35,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In888309970 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In888309970 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out888309970| ~a$r_buff0_thd3~0_In888309970) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out888309970| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In888309970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In888309970} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In888309970, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In888309970, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out888309970|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:56:35,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In963092460 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In963092460 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In963092460 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In963092460 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out963092460|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In963092460 |P2Thread1of1ForFork0_#t~ite43_Out963092460|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In963092460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In963092460, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In963092460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In963092460} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out963092460|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In963092460, ~a$w_buff0_used~0=~a$w_buff0_used~0_In963092460, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In963092460, ~a$w_buff1_used~0=~a$w_buff1_used~0_In963092460} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:56:35,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:56:35,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:56:35,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out1637465613| |ULTIMATE.start_main_#t~ite47_Out1637465613|)) (.cse2 (= (mod ~a$w_buff1_used~0_In1637465613 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1637465613 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In1637465613 |ULTIMATE.start_main_#t~ite47_Out1637465613|)) (and .cse1 (= ~a~0_In1637465613 |ULTIMATE.start_main_#t~ite47_Out1637465613|) (or .cse2 .cse0)))) InVars {~a~0=~a~0_In1637465613, ~a$w_buff1~0=~a$w_buff1~0_In1637465613, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1637465613, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1637465613} OutVars{~a~0=~a~0_In1637465613, ~a$w_buff1~0=~a$w_buff1~0_In1637465613, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1637465613|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1637465613, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1637465613|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1637465613} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:56:35,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In571346980 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In571346980 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out571346980| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out571346980| ~a$w_buff0_used~0_In571346980) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In571346980, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In571346980} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In571346980, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out571346980|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In571346980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:56:35,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In274587027 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In274587027 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In274587027 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In274587027 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In274587027 |ULTIMATE.start_main_#t~ite50_Out274587027|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out274587027|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In274587027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In274587027, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In274587027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In274587027} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out274587027|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In274587027, ~a$w_buff0_used~0=~a$w_buff0_used~0_In274587027, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In274587027, ~a$w_buff1_used~0=~a$w_buff1_used~0_In274587027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:56:35,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In114198151 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In114198151 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In114198151 |ULTIMATE.start_main_#t~ite51_Out114198151|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out114198151|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In114198151, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In114198151} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out114198151|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In114198151, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In114198151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:56:35,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1659827393 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1659827393 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1659827393 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1659827393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1659827393|)) (and (= ~a$r_buff1_thd0~0_In-1659827393 |ULTIMATE.start_main_#t~ite52_Out-1659827393|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1659827393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659827393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1659827393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659827393} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1659827393|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1659827393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659827393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1659827393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659827393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:56:35,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:56:36,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:56:36 BasicIcfg [2019-12-18 12:56:36,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:56:36,035 INFO L168 Benchmark]: Toolchain (without parser) took 108495.35 ms. Allocated memory was 145.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,035 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:56:36,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.53 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.5 MB in the beginning and 157.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.91 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 155.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,038 INFO L168 Benchmark]: Boogie Preprocessor took 38.41 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 152.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,038 INFO L168 Benchmark]: RCFGBuilder took 996.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,039 INFO L168 Benchmark]: TraceAbstraction took 106568.44 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 12:56:36,041 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.53 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.5 MB in the beginning and 157.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.91 ms. Allocated memory is still 204.5 MB. Free memory was 157.5 MB in the beginning and 155.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.41 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 152.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 996.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106568.44 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t653, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7200 SDtfs, 9931 SDslu, 24246 SDs, 0 SdLazy, 15398 SolverSat, 435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 92 SyntacticMatches, 22 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 179292 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1765 NumberOfCodeBlocks, 1765 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1665 ConstructedInterpolants, 0 QuantifiedInterpolants, 353510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...