/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:33:41,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:33:41,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:33:41,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:33:41,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:33:41,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:33:41,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:33:41,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:33:41,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:33:41,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:33:41,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:33:41,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:33:41,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:33:41,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:33:41,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:33:41,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:33:41,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:33:41,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:33:41,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:33:41,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:33:41,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:33:41,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:33:41,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:33:41,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:33:41,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:33:41,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:33:41,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:33:41,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:33:41,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:33:41,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:33:41,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:33:41,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:33:41,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:33:41,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:33:41,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:33:41,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:33:41,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:33:41,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:33:41,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:33:41,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:33:41,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:33:41,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:33:41,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:33:41,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:33:41,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:33:41,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:33:41,306 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:33:41,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:33:41,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:33:41,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:33:41,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:33:41,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:33:41,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:33:41,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:33:41,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:33:41,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:33:41,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:33:41,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:33:41,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:33:41,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:33:41,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:33:41,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:33:41,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:33:41,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:33:41,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:33:41,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:33:41,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:33:41,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:33:41,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:33:41,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:33:41,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:33:41,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:33:41,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:33:41,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:33:41,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:33:41,613 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:33:41,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-27 02:33:41,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cad3c29/dd56ec8e85ef46bba61abe1ae709ac1c/FLAG65d3116bb [2019-12-27 02:33:42,234 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:33:42,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-27 02:33:42,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cad3c29/dd56ec8e85ef46bba61abe1ae709ac1c/FLAG65d3116bb [2019-12-27 02:33:42,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6cad3c29/dd56ec8e85ef46bba61abe1ae709ac1c [2019-12-27 02:33:42,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:33:42,513 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:33:42,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:33:42,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:33:42,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:33:42,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:42" (1/1) ... [2019-12-27 02:33:42,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:42, skipping insertion in model container [2019-12-27 02:33:42,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:33:42" (1/1) ... [2019-12-27 02:33:42,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:33:42,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:33:43,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:33:43,202 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:33:43,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:33:43,349 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:33:43,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43 WrapperNode [2019-12-27 02:33:43,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:33:43,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:33:43,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:33:43,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:33:43,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:33:43,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:33:43,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:33:43,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:33:43,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (1/1) ... [2019-12-27 02:33:43,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:33:43,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:33:43,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:33:43,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:33:43,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (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-27 02:33:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:33:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:33:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:33:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:33:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:33:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:33:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:33:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:33:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:33:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:33:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:33:43,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:33:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:33:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:33:43,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:33:43,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-27 02:33:44,300 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:33:44,300 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:33:44,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:33:44 BoogieIcfgContainer [2019-12-27 02:33:44,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:33:44,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:33:44,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:33:44,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:33:44,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:33:42" (1/3) ... [2019-12-27 02:33:44,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d81cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:33:44, skipping insertion in model container [2019-12-27 02:33:44,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:33:43" (2/3) ... [2019-12-27 02:33:44,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d81cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:33:44, skipping insertion in model container [2019-12-27 02:33:44,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:33:44" (3/3) ... [2019-12-27 02:33:44,311 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-27 02:33:44,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:33:44,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:33:44,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:33:44,328 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:33:44,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,372 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,372 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,374 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,374 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,416 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,427 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,427 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,428 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:33:44,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:33:44,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:33:44,464 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:33:44,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:33:44,464 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:33:44,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:33:44,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:33:44,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:33:44,465 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:33:44,489 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 02:33:44,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:33:44,623 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:33:44,624 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:33:44,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:33:44,656 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 02:33:44,706 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 02:33:44,706 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:33:44,713 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:33:44,729 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:33:44,730 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:33:47,984 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-27 02:33:50,064 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 02:33:50,206 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 02:33:50,234 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-27 02:33:50,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-27 02:33:50,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 02:33:52,272 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-27 02:33:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-27 02:33:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:33:52,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:52,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:52,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-27 02:33:52,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:52,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64609566] [2019-12-27 02:33:52,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:52,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-27 02:33:52,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64609566] [2019-12-27 02:33:52,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:52,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:33:52,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214441785] [2019-12-27 02:33:52,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:33:52,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:33:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:33:52,622 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-27 02:33:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:54,194 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-27 02:33:54,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:33:54,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:33:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:54,540 INFO L225 Difference]: With dead ends: 33638 [2019-12-27 02:33:54,540 INFO L226 Difference]: Without dead ends: 32966 [2019-12-27 02:33:54,542 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-27 02:33:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-27 02:33:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-27 02:33:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-27 02:33:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-27 02:33:57,624 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-27 02:33:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:33:57,626 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-27 02:33:57,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:33:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-27 02:33:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:33:57,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:33:57,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:33:57,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:33:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:33:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-27 02:33:57,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:33:57,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160253159] [2019-12-27 02:33:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:33:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:33:57,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-27 02:33:57,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160253159] [2019-12-27 02:33:57,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:33:57,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:33:57,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783625159] [2019-12-27 02:33:57,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:33:57,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:33:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:33:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:33:57,814 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-27 02:33:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:33:58,649 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-27 02:33:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:33:58,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:33:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:33:59,265 INFO L225 Difference]: With dead ends: 44494 [2019-12-27 02:33:59,265 INFO L226 Difference]: Without dead ends: 44494 [2019-12-27 02:33:59,266 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-27 02:33:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-27 02:34:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-27 02:34:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-27 02:34:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-27 02:34:01,248 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-27 02:34:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:01,248 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-27 02:34:01,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:34:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-27 02:34:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:34:01,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:01,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:34:01,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-27 02:34:01,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:01,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068420023] [2019-12-27 02:34:01,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:01,360 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-27 02:34:01,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068420023] [2019-12-27 02:34:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:01,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413776467] [2019-12-27 02:34:01,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:34:01,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:34:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:34:01,363 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-27 02:34:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:03,533 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-27 02:34:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:34:03,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:34:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:03,872 INFO L225 Difference]: With dead ends: 62082 [2019-12-27 02:34:03,872 INFO L226 Difference]: Without dead ends: 62054 [2019-12-27 02:34:03,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:34:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-27 02:34:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-27 02:34:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-27 02:34:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-27 02:34:07,533 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-27 02:34:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:07,534 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-27 02:34:07,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:34:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-27 02:34:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:34:07,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:07,549 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] [2019-12-27 02:34:07,549 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-27 02:34:07,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:07,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205438377] [2019-12-27 02:34:07,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:07,630 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-27 02:34:07,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205438377] [2019-12-27 02:34:07,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:34:07,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204093180] [2019-12-27 02:34:07,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:34:07,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:07,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:34:07,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:34:07,634 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-27 02:34:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:08,750 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-27 02:34:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:34:08,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 02:34:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:08,973 INFO L225 Difference]: With dead ends: 68854 [2019-12-27 02:34:08,973 INFO L226 Difference]: Without dead ends: 68826 [2019-12-27 02:34:08,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-27 02:34:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-27 02:34:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-27 02:34:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-27 02:34:12,523 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-27 02:34:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:12,524 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-27 02:34:12,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:34:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-27 02:34:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:34:12,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:12,583 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] [2019-12-27 02:34:12,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-27 02:34:12,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:12,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889812465] [2019-12-27 02:34:12,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:12,654 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-27 02:34:12,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889812465] [2019-12-27 02:34:12,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:12,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:34:12,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332699897] [2019-12-27 02:34:12,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:12,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:12,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:12,657 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-27 02:34:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:13,421 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-27 02:34:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:13,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 02:34:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:13,586 INFO L225 Difference]: With dead ends: 64130 [2019-12-27 02:34:13,586 INFO L226 Difference]: Without dead ends: 64130 [2019-12-27 02:34:13,587 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-27 02:34:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-27 02:34:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-27 02:34:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-27 02:34:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-27 02:34:17,241 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-27 02:34:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:17,241 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-27 02:34:17,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-27 02:34:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:34:17,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:17,280 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] [2019-12-27 02:34:17,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-27 02:34:17,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:17,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825251805] [2019-12-27 02:34:17,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:17,373 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-27 02:34:17,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825251805] [2019-12-27 02:34:17,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:17,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:34:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104540108] [2019-12-27 02:34:17,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:17,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:17,375 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-27 02:34:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:18,611 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-27 02:34:18,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:34:18,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:34:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:18,829 INFO L225 Difference]: With dead ends: 81602 [2019-12-27 02:34:18,829 INFO L226 Difference]: Without dead ends: 81538 [2019-12-27 02:34:18,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-27 02:34:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-27 02:34:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:34:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-27 02:34:20,880 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-27 02:34:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:20,880 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-27 02:34:20,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-27 02:34:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:20,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:20,954 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] [2019-12-27 02:34:20,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-27 02:34:20,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:20,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289725587] [2019-12-27 02:34:20,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:21,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-27 02:34:21,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289725587] [2019-12-27 02:34:21,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:21,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:34:21,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700713567] [2019-12-27 02:34:21,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:34:21,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:34:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:34:21,038 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-27 02:34:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:23,623 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-27 02:34:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:34:23,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-27 02:34:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:23,787 INFO L225 Difference]: With dead ends: 65578 [2019-12-27 02:34:23,788 INFO L226 Difference]: Without dead ends: 65578 [2019-12-27 02:34:23,788 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-27 02:34:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-27 02:34:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-27 02:34:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-27 02:34:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-27 02:34:25,376 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-27 02:34:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:25,376 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-27 02:34:25,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:34:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-27 02:34:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:25,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:25,433 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] [2019-12-27 02:34:25,434 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-27 02:34:25,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:25,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832959294] [2019-12-27 02:34:25,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:25,619 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-27 02:34:25,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832959294] [2019-12-27 02:34:25,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:25,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:34:25,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204493611] [2019-12-27 02:34:25,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:34:25,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:25,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:34:25,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:34:25,622 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-27 02:34:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:27,781 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-27 02:34:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:34:27,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-27 02:34:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:28,012 INFO L225 Difference]: With dead ends: 89414 [2019-12-27 02:34:28,013 INFO L226 Difference]: Without dead ends: 89310 [2019-12-27 02:34:28,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:34:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-27 02:34:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-27 02:34:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-27 02:34:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-27 02:34:32,472 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-27 02:34:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:32,473 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-27 02:34:32,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:34:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-27 02:34:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 02:34:32,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:32,537 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] [2019-12-27 02:34:32,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-27 02:34:32,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:32,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089790844] [2019-12-27 02:34:32,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:32,653 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-27 02:34:32,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089790844] [2019-12-27 02:34:32,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:32,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:34:32,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168249528] [2019-12-27 02:34:32,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:34:32,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:34:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:34:32,656 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-27 02:34:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:33,890 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-27 02:34:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:34:33,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 02:34:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:34,081 INFO L225 Difference]: With dead ends: 74494 [2019-12-27 02:34:34,081 INFO L226 Difference]: Without dead ends: 71114 [2019-12-27 02:34:34,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:34:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-27 02:34:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-27 02:34:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-27 02:34:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-27 02:34:36,315 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-27 02:34:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:36,316 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-27 02:34:36,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:34:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-27 02:34:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:34:36,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:36,379 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] [2019-12-27 02:34:36,379 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-27 02:34:36,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:36,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593651728] [2019-12-27 02:34:36,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:36,597 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-27 02:34:36,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593651728] [2019-12-27 02:34:36,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:36,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:34:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581782571] [2019-12-27 02:34:36,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:34:36,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:34:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:36,600 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 10 states. [2019-12-27 02:34:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:37,929 INFO L93 Difference]: Finished difference Result 116392 states and 484250 transitions. [2019-12-27 02:34:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:34:37,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-27 02:34:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:38,196 INFO L225 Difference]: With dead ends: 116392 [2019-12-27 02:34:38,196 INFO L226 Difference]: Without dead ends: 98004 [2019-12-27 02:34:38,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:34:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98004 states. [2019-12-27 02:34:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98004 to 86086. [2019-12-27 02:34:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-12-27 02:34:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 356572 transitions. [2019-12-27 02:34:43,895 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 356572 transitions. Word has length 37 [2019-12-27 02:34:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:43,896 INFO L462 AbstractCegarLoop]: Abstraction has 86086 states and 356572 transitions. [2019-12-27 02:34:43,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:34:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 356572 transitions. [2019-12-27 02:34:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:34:44,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:44,011 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] [2019-12-27 02:34:44,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash 438975875, now seen corresponding path program 1 times [2019-12-27 02:34:44,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:44,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570519433] [2019-12-27 02:34:44,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:44,224 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-27 02:34:44,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570519433] [2019-12-27 02:34:44,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:44,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:34:44,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216107344] [2019-12-27 02:34:44,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:34:44,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:34:44,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:34:44,226 INFO L87 Difference]: Start difference. First operand 86086 states and 356572 transitions. Second operand 7 states. [2019-12-27 02:34:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:45,261 INFO L93 Difference]: Finished difference Result 124478 states and 511412 transitions. [2019-12-27 02:34:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:34:45,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-27 02:34:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:45,610 INFO L225 Difference]: With dead ends: 124478 [2019-12-27 02:34:45,610 INFO L226 Difference]: Without dead ends: 123998 [2019-12-27 02:34:45,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123998 states. [2019-12-27 02:34:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123998 to 107150. [2019-12-27 02:34:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107150 states. [2019-12-27 02:34:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107150 states to 107150 states and 443016 transitions. [2019-12-27 02:34:53,653 INFO L78 Accepts]: Start accepts. Automaton has 107150 states and 443016 transitions. Word has length 38 [2019-12-27 02:34:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:53,654 INFO L462 AbstractCegarLoop]: Abstraction has 107150 states and 443016 transitions. [2019-12-27 02:34:53,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:34:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 107150 states and 443016 transitions. [2019-12-27 02:34:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 02:34:53,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:53,806 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] [2019-12-27 02:34:53,806 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash 322595139, now seen corresponding path program 2 times [2019-12-27 02:34:53,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:53,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454703789] [2019-12-27 02:34:53,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:54,039 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-27 02:34:54,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454703789] [2019-12-27 02:34:54,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:54,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:34:54,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428264614] [2019-12-27 02:34:54,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:34:54,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:34:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:34:54,041 INFO L87 Difference]: Start difference. First operand 107150 states and 443016 transitions. Second operand 8 states. [2019-12-27 02:34:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:55,401 INFO L93 Difference]: Finished difference Result 97710 states and 396220 transitions. [2019-12-27 02:34:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:34:55,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-27 02:34:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:55,662 INFO L225 Difference]: With dead ends: 97710 [2019-12-27 02:34:55,662 INFO L226 Difference]: Without dead ends: 94254 [2019-12-27 02:34:55,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:34:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94254 states. [2019-12-27 02:34:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94254 to 69974. [2019-12-27 02:34:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69974 states. [2019-12-27 02:34:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69974 states to 69974 states and 284764 transitions. [2019-12-27 02:34:58,286 INFO L78 Accepts]: Start accepts. Automaton has 69974 states and 284764 transitions. Word has length 38 [2019-12-27 02:34:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:34:58,286 INFO L462 AbstractCegarLoop]: Abstraction has 69974 states and 284764 transitions. [2019-12-27 02:34:58,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:34:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 69974 states and 284764 transitions. [2019-12-27 02:34:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:34:58,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:34:58,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] [2019-12-27 02:34:58,388 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:34:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:34:58,388 INFO L82 PathProgramCache]: Analyzing trace with hash 922127842, now seen corresponding path program 1 times [2019-12-27 02:34:58,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:34:58,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319396050] [2019-12-27 02:34:58,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:34:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:34:58,474 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-27 02:34:58,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319396050] [2019-12-27 02:34:58,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:34:58,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:34:58,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896665589] [2019-12-27 02:34:58,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:34:58,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:34:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:34:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:34:58,476 INFO L87 Difference]: Start difference. First operand 69974 states and 284764 transitions. Second operand 4 states. [2019-12-27 02:34:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:34:58,862 INFO L93 Difference]: Finished difference Result 55546 states and 207661 transitions. [2019-12-27 02:34:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:34:58,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 02:34:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:34:59,032 INFO L225 Difference]: With dead ends: 55546 [2019-12-27 02:34:59,032 INFO L226 Difference]: Without dead ends: 54438 [2019-12-27 02:34:59,033 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-27 02:34:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54438 states. [2019-12-27 02:34:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54438 to 54438. [2019-12-27 02:34:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54438 states. [2019-12-27 02:35:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54438 states to 54438 states and 204185 transitions. [2019-12-27 02:35:04,337 INFO L78 Accepts]: Start accepts. Automaton has 54438 states and 204185 transitions. Word has length 39 [2019-12-27 02:35:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:04,337 INFO L462 AbstractCegarLoop]: Abstraction has 54438 states and 204185 transitions. [2019-12-27 02:35:04,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:35:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54438 states and 204185 transitions. [2019-12-27 02:35:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:35:04,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:04,399 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-27 02:35:04,399 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1151366660, now seen corresponding path program 1 times [2019-12-27 02:35:04,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:04,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224027691] [2019-12-27 02:35:04,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:04,485 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-27 02:35:04,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224027691] [2019-12-27 02:35:04,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:04,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:35:04,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179009937] [2019-12-27 02:35:04,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:35:04,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:35:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:35:04,488 INFO L87 Difference]: Start difference. First operand 54438 states and 204185 transitions. Second operand 6 states. [2019-12-27 02:35:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:04,875 INFO L93 Difference]: Finished difference Result 79849 states and 293441 transitions. [2019-12-27 02:35:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:35:04,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 02:35:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:04,971 INFO L225 Difference]: With dead ends: 79849 [2019-12-27 02:35:04,971 INFO L226 Difference]: Without dead ends: 45195 [2019-12-27 02:35:04,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:35:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45195 states. [2019-12-27 02:35:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45195 to 45195. [2019-12-27 02:35:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45195 states. [2019-12-27 02:35:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45195 states to 45195 states and 166907 transitions. [2019-12-27 02:35:05,783 INFO L78 Accepts]: Start accepts. Automaton has 45195 states and 166907 transitions. Word has length 40 [2019-12-27 02:35:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:05,783 INFO L462 AbstractCegarLoop]: Abstraction has 45195 states and 166907 transitions. [2019-12-27 02:35:05,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:35:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45195 states and 166907 transitions. [2019-12-27 02:35:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:35:05,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:05,829 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-27 02:35:05,829 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash 71622762, now seen corresponding path program 2 times [2019-12-27 02:35:05,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:05,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143905597] [2019-12-27 02:35:05,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:05,915 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-27 02:35:05,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143905597] [2019-12-27 02:35:05,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:05,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:35:05,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681388524] [2019-12-27 02:35:05,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:35:05,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:05,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:35:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:35:05,917 INFO L87 Difference]: Start difference. First operand 45195 states and 166907 transitions. Second operand 5 states. [2019-12-27 02:35:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:06,331 INFO L93 Difference]: Finished difference Result 15781 states and 49082 transitions. [2019-12-27 02:35:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:35:06,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:35:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:06,351 INFO L225 Difference]: With dead ends: 15781 [2019-12-27 02:35:06,351 INFO L226 Difference]: Without dead ends: 14975 [2019-12-27 02:35:06,352 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-27 02:35:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14975 states. [2019-12-27 02:35:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14975 to 14975. [2019-12-27 02:35:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14975 states. [2019-12-27 02:35:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 46525 transitions. [2019-12-27 02:35:06,561 INFO L78 Accepts]: Start accepts. Automaton has 14975 states and 46525 transitions. Word has length 40 [2019-12-27 02:35:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:06,561 INFO L462 AbstractCegarLoop]: Abstraction has 14975 states and 46525 transitions. [2019-12-27 02:35:06,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:35:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14975 states and 46525 transitions. [2019-12-27 02:35:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:35:06,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:06,571 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] [2019-12-27 02:35:06,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-27 02:35:06,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:06,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050443430] [2019-12-27 02:35:06,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:06,653 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-27 02:35:06,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050443430] [2019-12-27 02:35:06,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:06,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:35:06,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394131191] [2019-12-27 02:35:06,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:35:06,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:35:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:35:06,655 INFO L87 Difference]: Start difference. First operand 14975 states and 46525 transitions. Second operand 6 states. [2019-12-27 02:35:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:06,736 INFO L93 Difference]: Finished difference Result 3096 states and 7711 transitions. [2019-12-27 02:35:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:35:06,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 02:35:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:06,740 INFO L225 Difference]: With dead ends: 3096 [2019-12-27 02:35:06,740 INFO L226 Difference]: Without dead ends: 2765 [2019-12-27 02:35:06,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:35:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-12-27 02:35:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2765. [2019-12-27 02:35:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2019-12-27 02:35:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 6785 transitions. [2019-12-27 02:35:06,767 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 6785 transitions. Word has length 41 [2019-12-27 02:35:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:06,767 INFO L462 AbstractCegarLoop]: Abstraction has 2765 states and 6785 transitions. [2019-12-27 02:35:06,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:35:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 6785 transitions. [2019-12-27 02:35:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:35:06,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:06,769 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] [2019-12-27 02:35:06,770 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-27 02:35:06,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:06,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936907762] [2019-12-27 02:35:06,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:06,872 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-27 02:35:06,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936907762] [2019-12-27 02:35:06,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:06,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:35:06,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341217328] [2019-12-27 02:35:06,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:35:06,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:35:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:35:06,875 INFO L87 Difference]: Start difference. First operand 2765 states and 6785 transitions. Second operand 7 states. [2019-12-27 02:35:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:06,967 INFO L93 Difference]: Finished difference Result 1208 states and 3304 transitions. [2019-12-27 02:35:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:35:06,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 02:35:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:06,970 INFO L225 Difference]: With dead ends: 1208 [2019-12-27 02:35:06,970 INFO L226 Difference]: Without dead ends: 1162 [2019-12-27 02:35:06,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:35:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-27 02:35:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1050. [2019-12-27 02:35:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 02:35:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2894 transitions. [2019-12-27 02:35:06,982 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2894 transitions. Word has length 48 [2019-12-27 02:35:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:06,982 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2894 transitions. [2019-12-27 02:35:06,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:35:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2894 transitions. [2019-12-27 02:35:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:35:06,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:06,984 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] [2019-12-27 02:35:06,984 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-27 02:35:06,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:06,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816981973] [2019-12-27 02:35:06,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:07,134 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-27 02:35:07,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816981973] [2019-12-27 02:35:07,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:07,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:35:07,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136535547] [2019-12-27 02:35:07,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:35:07,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:35:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:35:07,142 INFO L87 Difference]: Start difference. First operand 1050 states and 2894 transitions. Second operand 7 states. [2019-12-27 02:35:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:07,278 INFO L93 Difference]: Finished difference Result 1752 states and 4637 transitions. [2019-12-27 02:35:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:35:07,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 02:35:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:07,280 INFO L225 Difference]: With dead ends: 1752 [2019-12-27 02:35:07,280 INFO L226 Difference]: Without dead ends: 675 [2019-12-27 02:35:07,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:35:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-12-27 02:35:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 587. [2019-12-27 02:35:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 02:35:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1308 transitions. [2019-12-27 02:35:07,287 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1308 transitions. Word has length 59 [2019-12-27 02:35:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:07,288 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1308 transitions. [2019-12-27 02:35:07,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:35:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1308 transitions. [2019-12-27 02:35:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:35:07,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:07,289 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] [2019-12-27 02:35:07,289 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 2 times [2019-12-27 02:35:07,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:07,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788735469] [2019-12-27 02:35:07,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:07,356 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-27 02:35:07,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788735469] [2019-12-27 02:35:07,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:07,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:35:07,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334722475] [2019-12-27 02:35:07,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:35:07,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:07,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:35:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:35:07,358 INFO L87 Difference]: Start difference. First operand 587 states and 1308 transitions. Second operand 3 states. [2019-12-27 02:35:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:07,369 INFO L93 Difference]: Finished difference Result 564 states and 1228 transitions. [2019-12-27 02:35:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:35:07,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 02:35:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:07,371 INFO L225 Difference]: With dead ends: 564 [2019-12-27 02:35:07,371 INFO L226 Difference]: Without dead ends: 564 [2019-12-27 02:35:07,371 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-27 02:35:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-27 02:35:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-12-27 02:35:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-27 02:35:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1228 transitions. [2019-12-27 02:35:07,379 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1228 transitions. Word has length 59 [2019-12-27 02:35:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:07,379 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1228 transitions. [2019-12-27 02:35:07,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:35:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1228 transitions. [2019-12-27 02:35:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:07,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:07,380 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] [2019-12-27 02:35:07,381 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-27 02:35:07,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:07,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412812751] [2019-12-27 02:35:07,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:07,824 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-27 02:35:07,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412812751] [2019-12-27 02:35:07,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:07,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 02:35:07,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315161359] [2019-12-27 02:35:07,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 02:35:07,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 02:35:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:35:07,826 INFO L87 Difference]: Start difference. First operand 564 states and 1228 transitions. Second operand 18 states. [2019-12-27 02:35:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:09,056 INFO L93 Difference]: Finished difference Result 1199 states and 2666 transitions. [2019-12-27 02:35:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 02:35:09,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-12-27 02:35:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:09,058 INFO L225 Difference]: With dead ends: 1199 [2019-12-27 02:35:09,059 INFO L226 Difference]: Without dead ends: 960 [2019-12-27 02:35:09,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 02:35:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-12-27 02:35:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 598. [2019-12-27 02:35:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-27 02:35:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1304 transitions. [2019-12-27 02:35:09,068 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1304 transitions. Word has length 60 [2019-12-27 02:35:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:09,068 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 1304 transitions. [2019-12-27 02:35:09,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 02:35:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1304 transitions. [2019-12-27 02:35:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:09,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:09,069 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] [2019-12-27 02:35:09,069 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1448363402, now seen corresponding path program 2 times [2019-12-27 02:35:09,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:09,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565312584] [2019-12-27 02:35:09,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:35:09,268 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-27 02:35:09,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565312584] [2019-12-27 02:35:09,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:35:09,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:35:09,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063741205] [2019-12-27 02:35:09,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:35:09,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:35:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:35:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:35:09,270 INFO L87 Difference]: Start difference. First operand 598 states and 1304 transitions. Second operand 12 states. [2019-12-27 02:35:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:35:09,557 INFO L93 Difference]: Finished difference Result 833 states and 1797 transitions. [2019-12-27 02:35:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:35:09,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 02:35:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:35:09,559 INFO L225 Difference]: With dead ends: 833 [2019-12-27 02:35:09,559 INFO L226 Difference]: Without dead ends: 546 [2019-12-27 02:35:09,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:35:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-27 02:35:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 532. [2019-12-27 02:35:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-27 02:35:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1146 transitions. [2019-12-27 02:35:09,566 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1146 transitions. Word has length 60 [2019-12-27 02:35:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:35:09,566 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1146 transitions. [2019-12-27 02:35:09,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:35:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1146 transitions. [2019-12-27 02:35:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 02:35:09,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:35:09,567 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] [2019-12-27 02:35:09,568 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:35:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:35:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 3 times [2019-12-27 02:35:09,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:35:09,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621198418] [2019-12-27 02:35:09,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:35:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:35:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:35:09,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:35:09,687 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:35:09,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= 0 v_~z$r_buff1_thd4~0_193) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1150~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1151~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:35:09,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-27 02:35:09,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 02:35:09,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-27 02:35:09,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff0_thd4~0_In-849329409 ~z$r_buff1_thd4~0_Out-849329409) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-849329409 0)) (= ~__unbuffered_p3_EAX~0_Out-849329409 ~a~0_Out-849329409) (= 1 ~a~0_Out-849329409) (= ~b~0_In-849329409 ~__unbuffered_p3_EBX~0_Out-849329409) (= ~z$r_buff1_thd0~0_Out-849329409 ~z$r_buff0_thd0~0_In-849329409) (= ~z$r_buff0_thd2~0_In-849329409 ~z$r_buff1_thd2~0_Out-849329409) (= ~z$r_buff1_thd3~0_Out-849329409 ~z$r_buff0_thd3~0_In-849329409) (= 1 ~z$r_buff0_thd4~0_Out-849329409) (= ~z$r_buff0_thd1~0_In-849329409 ~z$r_buff1_thd1~0_Out-849329409)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-849329409, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-849329409, ~b~0=~b~0_In-849329409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-849329409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849329409, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-849329409, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-849329409} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-849329409, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-849329409, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-849329409, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-849329409, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-849329409, ~a~0=~a~0_Out-849329409, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-849329409, ~b~0=~b~0_In-849329409, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-849329409, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-849329409, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-849329409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-849329409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849329409, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-849329409, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-849329409} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:35:09,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:35:09,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:35:09,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1340026909 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1340026909 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1340026909| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1340026909| ~z$w_buff0_used~0_In1340026909)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1340026909, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1340026909} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1340026909, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1340026909, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1340026909|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:35:09,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-2022689468 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2022689468 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-2022689468 |P2Thread1of1ForFork2_#t~ite3_Out-2022689468|) (not .cse1)) (and (= ~z~0_In-2022689468 |P2Thread1of1ForFork2_#t~ite3_Out-2022689468|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2022689468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022689468, ~z$w_buff1~0=~z$w_buff1~0_In-2022689468, ~z~0=~z~0_In-2022689468} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-2022689468|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2022689468, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022689468, ~z$w_buff1~0=~z$w_buff1~0_In-2022689468, ~z~0=~z~0_In-2022689468} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:35:09,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 02:35:09,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1550803688 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1550803688 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1550803688| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1550803688| ~z$w_buff0_used~0_In-1550803688)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550803688, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1550803688} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1550803688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1550803688, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1550803688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:35:09,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-37499275 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-37499275 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-37499275 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-37499275 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-37499275 |P2Thread1of1ForFork2_#t~ite6_Out-37499275|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite6_Out-37499275| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-37499275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-37499275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-37499275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-37499275} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-37499275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-37499275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-37499275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-37499275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-37499275} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:35:09,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1304029743 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1304029743 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1304029743| 0)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1304029743| ~z$r_buff0_thd3~0_In1304029743) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1304029743, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1304029743} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1304029743, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1304029743, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1304029743|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:35:09,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In301063633 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In301063633 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In301063633 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In301063633 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out301063633| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite8_Out301063633| ~z$r_buff1_thd3~0_In301063633) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In301063633, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In301063633, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301063633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In301063633} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In301063633, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In301063633, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301063633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In301063633, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out301063633|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:35:09,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:35:09,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1568793985 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1568793985 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1568793985 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1568793985 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out1568793985| 0)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1568793985| ~z$w_buff1_used~0_In1568793985) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1568793985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1568793985, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1568793985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1568793985} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1568793985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1568793985, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1568793985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1568793985, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1568793985|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 02:35:09,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In669712498 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In669712498 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out669712498)) (and (= ~z$r_buff0_thd4~0_In669712498 ~z$r_buff0_thd4~0_Out669712498) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In669712498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In669712498} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In669712498, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out669712498, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out669712498|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 02:35:09,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1038024098 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1038024098 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1038024098 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1038024098 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out-1038024098| ~z$r_buff1_thd4~0_In-1038024098) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-1038024098| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1038024098, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1038024098, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1038024098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1038024098} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1038024098, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1038024098, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1038024098|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1038024098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1038024098} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 02:35:09,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:35:09,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:35:09,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite20_Out1721030404| |ULTIMATE.start_main_#t~ite19_Out1721030404|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1721030404 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1721030404 256)))) (or (and (= ~z$w_buff1~0_In1721030404 |ULTIMATE.start_main_#t~ite19_Out1721030404|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse0 .cse2) (= ~z~0_In1721030404 |ULTIMATE.start_main_#t~ite19_Out1721030404|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1721030404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1721030404, ~z$w_buff1~0=~z$w_buff1~0_In1721030404, ~z~0=~z~0_In1721030404} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1721030404|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1721030404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1721030404, ~z$w_buff1~0=~z$w_buff1~0_In1721030404, ~z~0=~z~0_In1721030404, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1721030404|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:35:09,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-163360303 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-163360303 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-163360303|)) (and (= |ULTIMATE.start_main_#t~ite21_Out-163360303| ~z$w_buff0_used~0_In-163360303) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163360303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163360303} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163360303, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163360303, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-163360303|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:35:09,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In764625187 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In764625187 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In764625187 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In764625187 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out764625187| ~z$w_buff1_used~0_In764625187)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out764625187| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In764625187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In764625187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In764625187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In764625187} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In764625187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In764625187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In764625187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In764625187, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out764625187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:35:09,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1233759484 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1233759484 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out1233759484| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1233759484 |ULTIMATE.start_main_#t~ite23_Out1233759484|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233759484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233759484} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1233759484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233759484, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1233759484|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:35:09,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1522672219 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1522672219 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1522672219 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1522672219 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1522672219| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out-1522672219| ~z$r_buff1_thd0~0_In-1522672219) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522672219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522672219, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522672219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522672219} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1522672219, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1522672219, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522672219, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1522672219|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522672219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 02:35:09,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-893089151 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-893089151| |ULTIMATE.start_main_#t~ite37_Out-893089151|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-893089151 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-893089151 256))) (= (mod ~z$w_buff0_used~0_In-893089151 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-893089151 256))))) (= |ULTIMATE.start_main_#t~ite36_Out-893089151| ~z$w_buff0_used~0_In-893089151)) (and (= |ULTIMATE.start_main_#t~ite36_In-893089151| |ULTIMATE.start_main_#t~ite36_Out-893089151|) (= |ULTIMATE.start_main_#t~ite37_Out-893089151| ~z$w_buff0_used~0_In-893089151) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893089151, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893089151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-893089151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-893089151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-893089151|, ~weak$$choice2~0=~weak$$choice2~0_In-893089151} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893089151, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893089151, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-893089151, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-893089151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-893089151|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-893089151|, ~weak$$choice2~0=~weak$$choice2~0_In-893089151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:35:09,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1433797780 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1433797780| ~z$w_buff1_used~0_In-1433797780) (= |ULTIMATE.start_main_#t~ite39_In-1433797780| |ULTIMATE.start_main_#t~ite39_Out-1433797780|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1433797780 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1433797780 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1433797780 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1433797780 256))))) (= |ULTIMATE.start_main_#t~ite39_Out-1433797780| ~z$w_buff1_used~0_In-1433797780) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1433797780| |ULTIMATE.start_main_#t~ite40_Out-1433797780|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1433797780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433797780, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1433797780|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1433797780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433797780, ~weak$$choice2~0=~weak$$choice2~0_In-1433797780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1433797780, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1433797780|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1433797780|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1433797780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1433797780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1433797780, ~weak$$choice2~0=~weak$$choice2~0_In-1433797780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:35:09,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:35:09,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:35:09,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:35:09,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:35:09 BasicIcfg [2019-12-27 02:35:09,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:35:09,805 INFO L168 Benchmark]: Toolchain (without parser) took 87291.89 ms. Allocated memory was 146.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,805 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.58 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,807 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,807 INFO L168 Benchmark]: RCFGBuilder took 828.36 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 101.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,808 INFO L168 Benchmark]: TraceAbstraction took 85499.81 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:35:09,811 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.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.58 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 156.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.36 ms. Allocated memory is still 203.4 MB. Free memory was 150.6 MB in the beginning and 101.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85499.81 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 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(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2796 SDtfs, 3938 SDslu, 7639 SDs, 0 SdLazy, 4225 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 28 SyntacticMatches, 15 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107150occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 140790 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 160291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...