/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:28:13,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:28:13,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:28:13,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:28:13,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:28:13,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:28:13,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:28:13,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:28:13,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:28:13,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:28:13,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:28:13,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:28:13,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:28:13,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:28:13,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:28:13,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:28:13,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:28:13,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:28:13,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:28:13,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:28:13,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:28:13,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:28:13,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:28:13,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:28:13,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:28:13,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:28:13,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:28:13,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:28:13,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:28:13,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:28:13,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:28:13,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:28:13,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:28:13,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:28:13,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:28:13,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:28:13,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:28:13,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:28:13,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:28:13,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:28:13,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:28:13,294 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-18 17:28:13,307 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:28:13,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:28:13,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:28:13,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:28:13,309 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:28:13,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:28:13,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:28:13,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:28:13,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:28:13,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:28:13,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:28:13,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:28:13,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:28:13,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:28:13,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:28:13,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:28:13,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:28:13,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:28:13,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:28:13,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:28:13,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:28:13,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:28:13,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:28:13,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:28:13,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:28:13,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:28:13,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:28:13,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:28:13,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:28:13,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:28:13,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:28:13,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:28:13,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:28:13,606 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:28:13,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-18 17:28:13,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d63d25e7/ddc800cef536454a9cf3a87a7c7dd186/FLAG7864fb1d6 [2019-12-18 17:28:14,300 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:28:14,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-18 17:28:14,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d63d25e7/ddc800cef536454a9cf3a87a7c7dd186/FLAG7864fb1d6 [2019-12-18 17:28:14,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d63d25e7/ddc800cef536454a9cf3a87a7c7dd186 [2019-12-18 17:28:14,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:28:14,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:28:14,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:28:14,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:28:14,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:28:14,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:28:14" (1/1) ... [2019-12-18 17:28:14,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc3c32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:14, skipping insertion in model container [2019-12-18 17:28:14,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:28:14" (1/1) ... [2019-12-18 17:28:14,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:28:14,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:28:15,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:28:15,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:28:15,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:28:15,376 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:28:15,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15 WrapperNode [2019-12-18 17:28:15,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:28:15,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:28:15,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:28:15,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:28:15,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:28:15,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:28:15,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:28:15,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:28:15,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... [2019-12-18 17:28:15,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:28:15,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:28:15,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:28:15,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:28:15,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:28:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:28:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:28:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:28:15,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:28:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:28:15,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:28:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:28:15,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:28:15,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:28:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:28:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:28:15,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:28:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:28:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:28:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:28:15,576 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:28:16,338 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:28:16,338 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:28:16,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:28:16 BoogieIcfgContainer [2019-12-18 17:28:16,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:28:16,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:28:16,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:28:16,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:28:16,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:28:14" (1/3) ... [2019-12-18 17:28:16,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701387c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:28:16, skipping insertion in model container [2019-12-18 17:28:16,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:15" (2/3) ... [2019-12-18 17:28:16,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@701387c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:28:16, skipping insertion in model container [2019-12-18 17:28:16,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:28:16" (3/3) ... [2019-12-18 17:28:16,349 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-18 17:28:16,360 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:28:16,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:28:16,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:28:16,380 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:28:16,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,479 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,479 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,498 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,503 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,503 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,508 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:16,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:28:16,544 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:28:16,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:28:16,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:28:16,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:28:16,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:28:16,545 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:28:16,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:28:16,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:28:16,562 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 17:28:16,564 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:28:16,650 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:28:16,650 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:28:16,668 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. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:28:16,695 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:28:16,742 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:28:16,742 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:28:16,750 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. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:28:16,766 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:28:16,768 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:28:20,018 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-18 17:28:22,148 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:28:22,297 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:28:22,317 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 17:28:22,317 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 17:28:22,321 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 17:28:24,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 17:28:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 17:28:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:28:24,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:24,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:24,643 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-18 17:28:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 17:28:24,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:24,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463603781] [2019-12-18 17:28:24,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:24,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463603781] [2019-12-18 17:28:24,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:24,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:28:24,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842560684] [2019-12-18 17:28:24,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:24,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:25,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:25,008 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 17:28:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:26,546 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 17:28:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:26,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:28:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:26,853 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 17:28:26,853 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 17:28:26,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 17:28:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 17:28:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 17:28:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 17:28:28,866 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 17:28:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:28,867 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 17:28:28,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 17:28:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:28:28,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:28,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:28,880 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-18 17:28:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 17:28:28,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:28,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390410635] [2019-12-18 17:28:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:29,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390410635] [2019-12-18 17:28:29,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:29,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:29,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065470892] [2019-12-18 17:28:29,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:29,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:29,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:29,041 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 17:28:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:30,144 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 17:28:30,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:30,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:28:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:32,097 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 17:28:32,097 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 17:28:32,099 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-18 17:28:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 17:28:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 17:28:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 17:28:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 17:28:33,871 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 17:28:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:33,871 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 17:28:33,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 17:28:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:28:33,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:33,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:28:33,875 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-18 17:28:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 17:28:33,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:33,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599907823] [2019-12-18 17:28:33,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:34,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599907823] [2019-12-18 17:28:34,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:34,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:34,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161882021] [2019-12-18 17:28:34,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:34,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:34,007 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 17:28:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:34,951 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 17:28:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:34,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:28:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:35,362 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 17:28:35,362 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 17:28:35,363 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-18 17:28:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 17:28:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 17:28:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 17:28:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 17:28:39,172 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 17:28:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:39,173 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 17:28:39,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 17:28:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:28:39,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:39,186 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-18 17:28:39,186 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-18 17:28:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 17:28:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:39,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476933458] [2019-12-18 17:28:39,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:39,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476933458] [2019-12-18 17:28:39,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:39,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:39,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019517560] [2019-12-18 17:28:39,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:28:39,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:28:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:28:39,309 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 17:28:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:40,458 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 17:28:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:28:40,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 17:28:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:40,677 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 17:28:40,677 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 17:28:40,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 17:28:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 17:28:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 17:28:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 17:28:44,601 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 17:28:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:44,602 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 17:28:44,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:28:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 17:28:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:28:44,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:44,659 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-18 17:28:44,660 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-18 17:28:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 17:28:44,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:44,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294580537] [2019-12-18 17:28:44,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:44,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294580537] [2019-12-18 17:28:44,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:44,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:44,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13678514] [2019-12-18 17:28:44,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:44,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:44,729 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 17:28:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:45,096 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 17:28:45,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:45,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 17:28:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:45,308 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 17:28:45,309 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 17:28:45,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 17:28:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 17:28:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 17:28:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 17:28:50,062 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 17:28:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:50,062 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 17:28:50,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 17:28:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:28:50,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:50,101 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-18 17:28:50,101 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-18 17:28:50,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 17:28:50,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:50,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675387542] [2019-12-18 17:28:50,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:50,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675387542] [2019-12-18 17:28:50,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:50,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:50,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007070163] [2019-12-18 17:28:50,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:28:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:28:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:28:50,251 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 17:28:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:50,978 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 17:28:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:28:50,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:28:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:51,187 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 17:28:51,187 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 17:28:51,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 17:28:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 17:28:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:28:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 17:28:55,845 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 17:28:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:55,845 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 17:28:55,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:28:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 17:28:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:28:55,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:55,922 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-18 17:28:55,922 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-18 17:28:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 17:28:55,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:55,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105381984] [2019-12-18 17:28:55,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:28:56,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105381984] [2019-12-18 17:28:56,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:56,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:56,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277458958] [2019-12-18 17:28:56,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:56,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:56,025 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 17:28:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:56,387 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 17:28:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:56,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 17:28:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:56,556 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 17:28:56,556 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 17:28:56,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 17:28:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 17:28:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:29:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 17:29:02,284 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 17:29:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:02,285 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 17:29:02,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 17:29:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:02,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:02,346 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-18 17:29:02,346 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-18 17:29:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 17:29:02,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:02,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991447374] [2019-12-18 17:29:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:02,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991447374] [2019-12-18 17:29:02,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:02,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:29:02,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442360673] [2019-12-18 17:29:02,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:02,473 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 7 states. [2019-12-18 17:29:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:03,836 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 17:29:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:29:03,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 17:29:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:04,076 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 17:29:04,076 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 17:29:04,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:29:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 17:29:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 17:29:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 17:29:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 17:29:05,822 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 17:29:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:05,823 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 17:29:05,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 17:29:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:05,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:05,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:05,887 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-18 17:29:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 17:29:05,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:05,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099425746] [2019-12-18 17:29:05,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:06,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099425746] [2019-12-18 17:29:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:06,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:06,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614534441] [2019-12-18 17:29:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:06,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:06,004 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 6 states. [2019-12-18 17:29:06,906 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-18 17:29:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:07,211 INFO L93 Difference]: Finished difference Result 74494 states and 310372 transitions. [2019-12-18 17:29:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:29:07,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 17:29:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:07,389 INFO L225 Difference]: With dead ends: 74494 [2019-12-18 17:29:07,389 INFO L226 Difference]: Without dead ends: 71114 [2019-12-18 17:29:07,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71114 states. [2019-12-18 17:29:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71114 to 65978. [2019-12-18 17:29:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65978 states. [2019-12-18 17:29:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65978 states to 65978 states and 274224 transitions. [2019-12-18 17:29:09,560 INFO L78 Accepts]: Start accepts. Automaton has 65978 states and 274224 transitions. Word has length 35 [2019-12-18 17:29:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 65978 states and 274224 transitions. [2019-12-18 17:29:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65978 states and 274224 transitions. [2019-12-18 17:29:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 17:29:09,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:09,629 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-18 17:29:09,629 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-18 17:29:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817762, now seen corresponding path program 1 times [2019-12-18 17:29:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:09,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067902056] [2019-12-18 17:29:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:09,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067902056] [2019-12-18 17:29:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:29:09,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139194696] [2019-12-18 17:29:09,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:29:09,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:29:09,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:09,767 INFO L87 Difference]: Start difference. First operand 65978 states and 274224 transitions. Second operand 9 states. [2019-12-18 17:29:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:10,714 INFO L93 Difference]: Finished difference Result 119146 states and 495152 transitions. [2019-12-18 17:29:10,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:29:10,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 17:29:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:10,975 INFO L225 Difference]: With dead ends: 119146 [2019-12-18 17:29:10,975 INFO L226 Difference]: Without dead ends: 99178 [2019-12-18 17:29:10,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:29:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99178 states. [2019-12-18 17:29:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99178 to 94581. [2019-12-18 17:29:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94581 states. [2019-12-18 17:29:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94581 states to 94581 states and 394878 transitions. [2019-12-18 17:29:17,026 INFO L78 Accepts]: Start accepts. Automaton has 94581 states and 394878 transitions. Word has length 37 [2019-12-18 17:29:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:17,026 INFO L462 AbstractCegarLoop]: Abstraction has 94581 states and 394878 transitions. [2019-12-18 17:29:17,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:29:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 94581 states and 394878 transitions. [2019-12-18 17:29:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:29:17,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:17,148 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-18 17:29:17,149 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-18 17:29:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash -475384636, now seen corresponding path program 1 times [2019-12-18 17:29:17,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:17,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259139953] [2019-12-18 17:29:17,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:17,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259139953] [2019-12-18 17:29:17,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:17,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:17,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591584722] [2019-12-18 17:29:17,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:17,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:17,220 INFO L87 Difference]: Start difference. First operand 94581 states and 394878 transitions. Second operand 4 states. [2019-12-18 17:29:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:17,630 INFO L93 Difference]: Finished difference Result 73790 states and 283246 transitions. [2019-12-18 17:29:17,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:29:17,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-18 17:29:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:18,692 INFO L225 Difference]: With dead ends: 73790 [2019-12-18 17:29:18,692 INFO L226 Difference]: Without dead ends: 72682 [2019-12-18 17:29:18,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72682 states. [2019-12-18 17:29:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72682 to 72682. [2019-12-18 17:29:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72682 states. [2019-12-18 17:29:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72682 states to 72682 states and 279770 transitions. [2019-12-18 17:29:21,157 INFO L78 Accepts]: Start accepts. Automaton has 72682 states and 279770 transitions. Word has length 38 [2019-12-18 17:29:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:21,158 INFO L462 AbstractCegarLoop]: Abstraction has 72682 states and 279770 transitions. [2019-12-18 17:29:21,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 72682 states and 279770 transitions. [2019-12-18 17:29:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:29:21,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:21,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:21,240 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-18 17:29:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1056030818, now seen corresponding path program 1 times [2019-12-18 17:29:21,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:21,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154484384] [2019-12-18 17:29:21,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:21,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154484384] [2019-12-18 17:29:21,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:21,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:29:21,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425409083] [2019-12-18 17:29:21,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:21,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:21,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:21,343 INFO L87 Difference]: Start difference. First operand 72682 states and 279770 transitions. Second operand 6 states. [2019-12-18 17:29:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:21,834 INFO L93 Difference]: Finished difference Result 107085 states and 404984 transitions. [2019-12-18 17:29:21,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:29:21,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 17:29:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:21,968 INFO L225 Difference]: With dead ends: 107085 [2019-12-18 17:29:21,968 INFO L226 Difference]: Without dead ends: 61068 [2019-12-18 17:29:21,968 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-18 17:29:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61068 states. [2019-12-18 17:29:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61068 to 61068. [2019-12-18 17:29:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61068 states. [2019-12-18 17:29:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61068 states to 61068 states and 232467 transitions. [2019-12-18 17:29:26,460 INFO L78 Accepts]: Start accepts. Automaton has 61068 states and 232467 transitions. Word has length 39 [2019-12-18 17:29:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:26,460 INFO L462 AbstractCegarLoop]: Abstraction has 61068 states and 232467 transitions. [2019-12-18 17:29:26,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 61068 states and 232467 transitions. [2019-12-18 17:29:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:29:26,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:26,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:26,520 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-18 17:29:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash -779914948, now seen corresponding path program 2 times [2019-12-18 17:29:26,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:26,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83524138] [2019-12-18 17:29:26,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:26,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83524138] [2019-12-18 17:29:26,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:26,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:29:26,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951085760] [2019-12-18 17:29:26,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:29:26,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:29:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:29:26,670 INFO L87 Difference]: Start difference. First operand 61068 states and 232467 transitions. Second operand 10 states. [2019-12-18 17:29:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:27,655 INFO L93 Difference]: Finished difference Result 101963 states and 386666 transitions. [2019-12-18 17:29:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:29:27,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-12-18 17:29:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:28,479 INFO L225 Difference]: With dead ends: 101963 [2019-12-18 17:29:28,479 INFO L226 Difference]: Without dead ends: 88747 [2019-12-18 17:29:28,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-18 17:29:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88747 states. [2019-12-18 17:29:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88747 to 57718. [2019-12-18 17:29:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57718 states. [2019-12-18 17:29:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57718 states to 57718 states and 217599 transitions. [2019-12-18 17:29:29,726 INFO L78 Accepts]: Start accepts. Automaton has 57718 states and 217599 transitions. Word has length 39 [2019-12-18 17:29:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:29,727 INFO L462 AbstractCegarLoop]: Abstraction has 57718 states and 217599 transitions. [2019-12-18 17:29:29,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:29:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 57718 states and 217599 transitions. [2019-12-18 17:29:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:29:29,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:29,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:29,789 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-18 17:29:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 134445563, now seen corresponding path program 1 times [2019-12-18 17:29:29,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:29,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508917211] [2019-12-18 17:29:29,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:30,706 WARN L192 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 9 [2019-12-18 17:29:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:30,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508917211] [2019-12-18 17:29:30,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:30,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:29:30,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654533715] [2019-12-18 17:29:30,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:29:30,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:29:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:29:30,717 INFO L87 Difference]: Start difference. First operand 57718 states and 217599 transitions. Second operand 8 states. [2019-12-18 17:29:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:31,510 INFO L93 Difference]: Finished difference Result 79262 states and 293212 transitions. [2019-12-18 17:29:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:29:31,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-18 17:29:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:31,701 INFO L225 Difference]: With dead ends: 79262 [2019-12-18 17:29:31,702 INFO L226 Difference]: Without dead ends: 78854 [2019-12-18 17:29:31,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78854 states. [2019-12-18 17:29:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78854 to 69138. [2019-12-18 17:29:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69138 states. [2019-12-18 17:29:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69138 states to 69138 states and 257956 transitions. [2019-12-18 17:29:35,817 INFO L78 Accepts]: Start accepts. Automaton has 69138 states and 257956 transitions. Word has length 39 [2019-12-18 17:29:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:35,817 INFO L462 AbstractCegarLoop]: Abstraction has 69138 states and 257956 transitions. [2019-12-18 17:29:35,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:29:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 69138 states and 257956 transitions. [2019-12-18 17:29:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:29:35,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:35,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:35,894 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-18 17:29:35,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:35,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1106388304, now seen corresponding path program 1 times [2019-12-18 17:29:35,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:35,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511650948] [2019-12-18 17:29:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:35,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511650948] [2019-12-18 17:29:35,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:35,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:35,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23027839] [2019-12-18 17:29:35,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:29:35,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:29:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:35,968 INFO L87 Difference]: Start difference. First operand 69138 states and 257956 transitions. Second operand 5 states. [2019-12-18 17:29:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:36,074 INFO L93 Difference]: Finished difference Result 21764 states and 68130 transitions. [2019-12-18 17:29:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:36,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 17:29:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:36,103 INFO L225 Difference]: With dead ends: 21764 [2019-12-18 17:29:36,104 INFO L226 Difference]: Without dead ends: 20814 [2019-12-18 17:29:36,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20814 states. [2019-12-18 17:29:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20814 to 20814. [2019-12-18 17:29:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20814 states. [2019-12-18 17:29:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20814 states to 20814 states and 65080 transitions. [2019-12-18 17:29:36,388 INFO L78 Accepts]: Start accepts. Automaton has 20814 states and 65080 transitions. Word has length 39 [2019-12-18 17:29:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:36,389 INFO L462 AbstractCegarLoop]: Abstraction has 20814 states and 65080 transitions. [2019-12-18 17:29:36,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:29:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 20814 states and 65080 transitions. [2019-12-18 17:29:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:29:36,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:36,404 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-18 17:29:36,404 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-18 17:29:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1368489979, now seen corresponding path program 1 times [2019-12-18 17:29:36,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:36,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451773969] [2019-12-18 17:29:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:36,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451773969] [2019-12-18 17:29:36,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:36,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:29:36,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077415450] [2019-12-18 17:29:36,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:36,487 INFO L87 Difference]: Start difference. First operand 20814 states and 65080 transitions. Second operand 6 states. [2019-12-18 17:29:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:36,564 INFO L93 Difference]: Finished difference Result 3726 states and 9431 transitions. [2019-12-18 17:29:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:29:36,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 17:29:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:36,569 INFO L225 Difference]: With dead ends: 3726 [2019-12-18 17:29:36,570 INFO L226 Difference]: Without dead ends: 3341 [2019-12-18 17:29:36,570 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-18 17:29:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2019-12-18 17:29:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 3281. [2019-12-18 17:29:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-12-18 17:29:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 8153 transitions. [2019-12-18 17:29:36,600 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 8153 transitions. Word has length 41 [2019-12-18 17:29:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:36,600 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 8153 transitions. [2019-12-18 17:29:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 8153 transitions. [2019-12-18 17:29:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:29:36,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:36,603 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-18 17:29:36,603 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-18 17:29:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-18 17:29:36,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:36,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609019766] [2019-12-18 17:29:36,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:36,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609019766] [2019-12-18 17:29:36,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:36,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:29:36,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463115040] [2019-12-18 17:29:36,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:36,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:36,696 INFO L87 Difference]: Start difference. First operand 3281 states and 8153 transitions. Second operand 7 states. [2019-12-18 17:29:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:36,786 INFO L93 Difference]: Finished difference Result 1348 states and 3727 transitions. [2019-12-18 17:29:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:29:36,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 17:29:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:36,788 INFO L225 Difference]: With dead ends: 1348 [2019-12-18 17:29:36,788 INFO L226 Difference]: Without dead ends: 1298 [2019-12-18 17:29:36,789 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-18 17:29:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-18 17:29:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1058. [2019-12-18 17:29:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-18 17:29:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-18 17:29:36,800 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 48 [2019-12-18 17:29:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:36,800 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-18 17:29:36,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-18 17:29:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:29:36,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:36,801 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-18 17:29:36,801 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-18 17:29:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-18 17:29:36,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:36,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049333520] [2019-12-18 17:29:36,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:36,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049333520] [2019-12-18 17:29:36,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:36,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:36,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540571691] [2019-12-18 17:29:36,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:36,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:36,878 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 3 states. [2019-12-18 17:29:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:36,896 INFO L93 Difference]: Finished difference Result 1012 states and 2725 transitions. [2019-12-18 17:29:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:36,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:29:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:36,898 INFO L225 Difference]: With dead ends: 1012 [2019-12-18 17:29:36,898 INFO L226 Difference]: Without dead ends: 1012 [2019-12-18 17:29:36,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-12-18 17:29:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2019-12-18 17:29:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-12-18 17:29:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2725 transitions. [2019-12-18 17:29:36,913 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 2725 transitions. Word has length 59 [2019-12-18 17:29:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:36,913 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 2725 transitions. [2019-12-18 17:29:36,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 2725 transitions. [2019-12-18 17:29:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:29:36,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:36,915 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-18 17:29:36,915 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-18 17:29:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash -311204278, now seen corresponding path program 1 times [2019-12-18 17:29:36,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:36,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320133923] [2019-12-18 17:29:36,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:37,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320133923] [2019-12-18 17:29:37,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:37,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:29:37,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130653364] [2019-12-18 17:29:37,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:37,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:37,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:37,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:37,029 INFO L87 Difference]: Start difference. First operand 1012 states and 2725 transitions. Second operand 7 states. [2019-12-18 17:29:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:37,153 INFO L93 Difference]: Finished difference Result 1655 states and 4226 transitions. [2019-12-18 17:29:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:29:37,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 17:29:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:37,155 INFO L225 Difference]: With dead ends: 1655 [2019-12-18 17:29:37,155 INFO L226 Difference]: Without dead ends: 638 [2019-12-18 17:29:37,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-12-18 17:29:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 572. [2019-12-18 17:29:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-18 17:29:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-18 17:29:37,162 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 60 [2019-12-18 17:29:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:37,162 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-18 17:29:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-18 17:29:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:29:37,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:37,163 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-18 17:29:37,163 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-18 17:29:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 2 times [2019-12-18 17:29:37,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:37,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105059828] [2019-12-18 17:29:37,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:37,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105059828] [2019-12-18 17:29:37,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:37,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:29:37,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388331712] [2019-12-18 17:29:37,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:29:37,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:37,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:29:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:29:37,471 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 13 states. [2019-12-18 17:29:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:37,905 INFO L93 Difference]: Finished difference Result 908 states and 1982 transitions. [2019-12-18 17:29:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:29:37,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:29:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:37,907 INFO L225 Difference]: With dead ends: 908 [2019-12-18 17:29:37,908 INFO L226 Difference]: Without dead ends: 874 [2019-12-18 17:29:37,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:29:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-18 17:29:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 783. [2019-12-18 17:29:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-18 17:29:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1714 transitions. [2019-12-18 17:29:37,916 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1714 transitions. Word has length 60 [2019-12-18 17:29:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:37,917 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1714 transitions. [2019-12-18 17:29:37,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:29:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1714 transitions. [2019-12-18 17:29:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:29:37,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:37,918 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-18 17:29:37,918 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-18 17:29:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 3 times [2019-12-18 17:29:37,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:37,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578590175] [2019-12-18 17:29:37,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:29:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:29:38,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:29:38,351 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:29:38,356 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) (= 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) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= 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_~z$r_buff0_thd2~0_135 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$r_buff1_thd3~0_221) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= 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 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= 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) (= 0 v_~z$r_buff1_thd4~0_193) (= 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_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, 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, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~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|, ~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, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~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_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, 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_#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|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~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_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~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_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~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_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, 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_~#t1144~0.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, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~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, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~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_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, 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, ULTIMATE.start_main_~#t1143~0.offset, ~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_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:29:38,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #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_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-18 17:29:38,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~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|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-18 17:29:38,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) 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_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:29:38,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~z$r_buff1_thd3~0_Out-1299225473 ~z$r_buff0_thd3~0_In-1299225473) (= ~z$r_buff1_thd4~0_Out-1299225473 ~z$r_buff0_thd4~0_In-1299225473) (= 1 ~a~0_Out-1299225473) (= ~b~0_In-1299225473 ~__unbuffered_p3_EBX~0_Out-1299225473) (= ~z$r_buff1_thd2~0_Out-1299225473 ~z$r_buff0_thd2~0_In-1299225473) (= ~z$r_buff0_thd1~0_In-1299225473 ~z$r_buff1_thd1~0_Out-1299225473) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1299225473 0)) (= 1 ~z$r_buff0_thd4~0_Out-1299225473) (= ~__unbuffered_p3_EAX~0_Out-1299225473 ~a~0_Out-1299225473) (= ~z$r_buff1_thd0~0_Out-1299225473 ~z$r_buff0_thd0~0_In-1299225473)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1299225473, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1299225473, ~b~0=~b~0_In-1299225473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1299225473, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1299225473, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1299225473, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1299225473} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1299225473, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1299225473, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1299225473, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1299225473, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1299225473, ~a~0=~a~0_Out-1299225473, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1299225473, ~b~0=~b~0_In-1299225473, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1299225473, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1299225473, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1299225473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1299225473, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1299225473, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1299225473, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1299225473} 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-18 17:29:38,361 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-18 17:29:38,362 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-18 17:29:38,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In553239225 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In553239225 256)))) (or (and (= ~z$w_buff0_used~0_In553239225 |P3Thread1of1ForFork3_#t~ite11_Out553239225|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out553239225|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In553239225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In553239225} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In553239225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In553239225, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out553239225|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:29:38,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In614220836 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In614220836 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out614220836| ~z~0_In614220836)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out614220836| ~z$w_buff1~0_In614220836)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614220836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614220836, ~z$w_buff1~0=~z$w_buff1~0_In614220836, ~z~0=~z~0_In614220836} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out614220836|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614220836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614220836, ~z$w_buff1~0=~z$w_buff1~0_In614220836, ~z~0=~z~0_In614220836} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:29:38,365 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-18 17:29:38,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1708200299 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1708200299 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1708200299|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1708200299 |P2Thread1of1ForFork2_#t~ite5_Out1708200299|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1708200299, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1708200299} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1708200299|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1708200299, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1708200299} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:29:38,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1853108215 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1853108215 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1853108215 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1853108215 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out1853108215|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1853108215 |P2Thread1of1ForFork2_#t~ite6_Out1853108215|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1853108215, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1853108215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853108215, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1853108215} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1853108215|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853108215, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1853108215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853108215, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1853108215} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:29:38,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In774003116 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In774003116 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out774003116| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out774003116| ~z$r_buff0_thd3~0_In774003116)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In774003116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In774003116} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In774003116, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In774003116, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out774003116|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:29:38,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1095359037 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1095359037 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1095359037 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1095359037 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1095359037 |P2Thread1of1ForFork2_#t~ite8_Out-1095359037|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1095359037|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095359037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1095359037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1095359037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1095359037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095359037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1095359037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1095359037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1095359037, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1095359037|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:29:38,369 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-18 17:29:38,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1360938323 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1360938323 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1360938323 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1360938323 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1360938323 |P3Thread1of1ForFork3_#t~ite12_Out1360938323|)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1360938323| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1360938323, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1360938323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1360938323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360938323} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1360938323, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1360938323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1360938323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1360938323, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1360938323|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:29:38,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1656381224 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1656381224 256)))) (or (and (= ~z$r_buff0_thd4~0_Out1656381224 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1656381224 ~z$r_buff0_thd4~0_In1656381224)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1656381224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1656381224} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1656381224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1656381224, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1656381224|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:29:38,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1894858241 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1894858241 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1894858241 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1894858241 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1894858241 |P3Thread1of1ForFork3_#t~ite14_Out-1894858241|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1894858241|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1894858241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894858241, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1894858241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894858241} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1894858241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894858241, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1894858241|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1894858241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894858241} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:29:38,372 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-18 17:29:38,374 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-18 17:29:38,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite20_Out-2094639741| |ULTIMATE.start_main_#t~ite19_Out-2094639741|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2094639741 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-2094639741 256) 0))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-2094639741 |ULTIMATE.start_main_#t~ite19_Out-2094639741|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-2094639741 |ULTIMATE.start_main_#t~ite19_Out-2094639741|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2094639741, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2094639741, ~z$w_buff1~0=~z$w_buff1~0_In-2094639741, ~z~0=~z~0_In-2094639741} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2094639741|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2094639741, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2094639741, ~z$w_buff1~0=~z$w_buff1~0_In-2094639741, ~z~0=~z~0_In-2094639741, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2094639741|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:29:38,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In745117695 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In745117695 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out745117695| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out745117695| ~z$w_buff0_used~0_In745117695)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In745117695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In745117695} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In745117695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In745117695, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out745117695|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:29:38,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In182919776 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In182919776 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In182919776 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In182919776 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out182919776|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In182919776 |ULTIMATE.start_main_#t~ite22_Out182919776|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In182919776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In182919776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In182919776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In182919776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In182919776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In182919776, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out182919776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:29:38,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1160853845 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1160853845 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1160853845| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1160853845 |ULTIMATE.start_main_#t~ite23_Out-1160853845|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1160853845, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1160853845} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1160853845, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1160853845, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1160853845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:29:38,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1431489906 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1431489906 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1431489906 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1431489906 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1431489906|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-1431489906 |ULTIMATE.start_main_#t~ite24_Out-1431489906|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1431489906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431489906, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431489906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431489906} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1431489906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431489906, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1431489906, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1431489906|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431489906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:29:38,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-104187214 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-104187214 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-104187214 256))) (= (mod ~z$w_buff0_used~0_In-104187214 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-104187214 256))))) (= |ULTIMATE.start_main_#t~ite37_Out-104187214| |ULTIMATE.start_main_#t~ite36_Out-104187214|) .cse1 (= ~z$w_buff0_used~0_In-104187214 |ULTIMATE.start_main_#t~ite36_Out-104187214|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_In-104187214| |ULTIMATE.start_main_#t~ite36_Out-104187214|) (= |ULTIMATE.start_main_#t~ite37_Out-104187214| ~z$w_buff0_used~0_In-104187214)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-104187214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-104187214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-104187214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-104187214, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-104187214|, ~weak$$choice2~0=~weak$$choice2~0_In-104187214} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-104187214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-104187214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-104187214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-104187214, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-104187214|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-104187214|, ~weak$$choice2~0=~weak$$choice2~0_In-104187214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:29:38,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In183660686 256)))) (or (and (= ~z$w_buff1_used~0_In183660686 |ULTIMATE.start_main_#t~ite39_Out183660686|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In183660686 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In183660686 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In183660686 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In183660686 256))))) .cse1 (= |ULTIMATE.start_main_#t~ite40_Out183660686| |ULTIMATE.start_main_#t~ite39_Out183660686|)) (and (= |ULTIMATE.start_main_#t~ite39_In183660686| |ULTIMATE.start_main_#t~ite39_Out183660686|) (= |ULTIMATE.start_main_#t~ite40_Out183660686| ~z$w_buff1_used~0_In183660686) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In183660686, ~z$w_buff0_used~0=~z$w_buff0_used~0_In183660686, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In183660686|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In183660686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In183660686, ~weak$$choice2~0=~weak$$choice2~0_In183660686} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In183660686, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out183660686|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out183660686|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In183660686, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In183660686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In183660686, ~weak$$choice2~0=~weak$$choice2~0_In183660686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:29:38,386 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-18 17:29:38,388 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-18 17:29:38,388 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-18 17:29:38,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:29:38 BasicIcfg [2019-12-18 17:29:38,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:29:38,474 INFO L168 Benchmark]: Toolchain (without parser) took 83850.89 ms. Allocated memory was 146.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 727.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,474 INFO L168 Benchmark]: CDTParser took 0.23 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.02 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 157.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,476 INFO L168 Benchmark]: Boogie Preprocessor took 53.22 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,477 INFO L168 Benchmark]: RCFGBuilder took 831.44 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 102.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,477 INFO L168 Benchmark]: TraceAbstraction took 82130.68 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 668.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:38,480 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.23 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.02 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 157.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.22 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.44 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 102.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82130.68 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 668.5 MB. 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.4s, 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(&t1141, ((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(&t1142, ((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(&t1143, ((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(&t1144, ((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: 81.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3003 SDtfs, 3845 SDslu, 8478 SDs, 0 SdLazy, 3095 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 22 SyntacticMatches, 15 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94581occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 132967 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 702 ConstructedInterpolants, 0 QuantifiedInterpolants, 156847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...