/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:15,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:15,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:15,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:15,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:15,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:15,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:15,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:15,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:15,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:15,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:15,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:15,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:15,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:15,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:15,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:15,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:15,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:15,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:15,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:15,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:15,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:15,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:15,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:15,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:15,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:15,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:15,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:15,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:15,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:15,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:15,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:15,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:15,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:15,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:15,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:15,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:15,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:15,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:15,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:15,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:15,428 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-VariableLbe.epf [2019-12-27 06:29:15,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:15,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:15,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:15,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:15,450 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:15,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:15,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:15,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:15,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:15,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:15,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:15,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:15,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:15,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:15,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:15,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:15,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:15,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:15,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:15,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:15,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:15,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:15,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:15,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:15,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:15,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:15,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:15,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:15,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:15,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:15,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:15,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:15,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:15,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:15,736 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:15,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-27 06:29:15,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e097c3fa8/8e887e4fcd304505953e57b534609a7f/FLAG87e05b1f0 [2019-12-27 06:29:16,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:16,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-27 06:29:16,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e097c3fa8/8e887e4fcd304505953e57b534609a7f/FLAG87e05b1f0 [2019-12-27 06:29:16,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e097c3fa8/8e887e4fcd304505953e57b534609a7f [2019-12-27 06:29:16,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:16,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:16,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:16,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:16,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:16,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:16" (1/1) ... [2019-12-27 06:29:16,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:16, skipping insertion in model container [2019-12-27 06:29:16,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:16" (1/1) ... [2019-12-27 06:29:16,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:16,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:17,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:17,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:17,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:17,429 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:17,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17 WrapperNode [2019-12-27 06:29:17,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:17,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:17,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:17,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:17,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:17,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:17,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:17,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:17,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... [2019-12-27 06:29:17,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:17,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:17,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:17,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:17,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:17,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:17,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:17,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:17,631 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:29:18,348 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:18,348 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:18,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:18 BoogieIcfgContainer [2019-12-27 06:29:18,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:18,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:18,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:18,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:18,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:16" (1/3) ... [2019-12-27 06:29:18,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24256e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:18, skipping insertion in model container [2019-12-27 06:29:18,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:17" (2/3) ... [2019-12-27 06:29:18,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24256e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:18, skipping insertion in model container [2019-12-27 06:29:18,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:18" (3/3) ... [2019-12-27 06:29:18,359 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2019-12-27 06:29:18,370 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:18,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:18,385 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:18,386 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:18,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,445 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,448 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,449 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:18,469 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:29:18,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:29:18,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:29:18,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:29:18,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:29:18,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:29:18,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:29:18,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:29:18,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:29:18,520 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 06:29:18,522 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:29:18,642 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:29:18,643 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:18,659 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:29:18,677 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:29:18,766 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:29:18,767 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:18,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:29:18,792 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:29:18,795 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:29:21,807 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 06:29:21,939 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:29:21,961 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-27 06:29:21,962 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 06:29:21,965 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-27 06:29:22,508 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:29:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:29:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:29:22,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:22,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:29:22,520 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-27 06:29:22,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:22,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734938683] [2019-12-27 06:29:22,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:22,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734938683] [2019-12-27 06:29:22,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:22,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:29:22,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234910357] [2019-12-27 06:29:22,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:22,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:22,927 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:29:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:23,174 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-27 06:29:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:23,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:29:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:23,295 INFO L225 Difference]: With dead ends: 9090 [2019-12-27 06:29:23,298 INFO L226 Difference]: Without dead ends: 8908 [2019-12-27 06:29:23,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-27 06:29:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-27 06:29:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-27 06:29:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-27 06:29:23,912 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-27 06:29:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:23,913 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-27 06:29:23,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-27 06:29:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:29:23,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:23,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:23,919 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-27 06:29:23,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:23,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504457189] [2019-12-27 06:29:23,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:24,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504457189] [2019-12-27 06:29:24,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:24,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:24,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153717789] [2019-12-27 06:29:24,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:24,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:24,088 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 4 states. [2019-12-27 06:29:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:24,479 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-27 06:29:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:24,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:29:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:24,555 INFO L225 Difference]: With dead ends: 14155 [2019-12-27 06:29:24,555 INFO L226 Difference]: Without dead ends: 14148 [2019-12-27 06:29:24,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-27 06:29:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-27 06:29:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-27 06:29:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-27 06:29:25,564 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-27 06:29:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:25,565 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-27 06:29:25,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-27 06:29:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:29:25,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:25,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:25,568 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-27 06:29:25,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:25,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721901553] [2019-12-27 06:29:25,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:25,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721901553] [2019-12-27 06:29:25,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:25,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:25,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806010946] [2019-12-27 06:29:25,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:25,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:25,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:25,685 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-27 06:29:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:25,727 INFO L93 Difference]: Finished difference Result 2009 states and 4645 transitions. [2019-12-27 06:29:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:29:25,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:29:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:25,733 INFO L225 Difference]: With dead ends: 2009 [2019-12-27 06:29:25,733 INFO L226 Difference]: Without dead ends: 1723 [2019-12-27 06:29:25,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-12-27 06:29:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2019-12-27 06:29:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-27 06:29:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 3854 transitions. [2019-12-27 06:29:25,777 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 3854 transitions. Word has length 11 [2019-12-27 06:29:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:25,777 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 3854 transitions. [2019-12-27 06:29:25,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3854 transitions. [2019-12-27 06:29:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:29:25,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:25,780 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] [2019-12-27 06:29:25,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1819811138, now seen corresponding path program 1 times [2019-12-27 06:29:25,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:25,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025904951] [2019-12-27 06:29:25,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:25,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025904951] [2019-12-27 06:29:25,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:25,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:29:25,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457285632] [2019-12-27 06:29:25,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:25,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:25,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:25,906 INFO L87 Difference]: Start difference. First operand 1723 states and 3854 transitions. Second operand 5 states. [2019-12-27 06:29:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:25,959 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-27 06:29:25,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:25,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 06:29:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:25,961 INFO L225 Difference]: With dead ends: 403 [2019-12-27 06:29:25,961 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 06:29:25,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 06:29:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 06:29:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:29:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-27 06:29:25,969 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-27 06:29:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:25,969 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-27 06:29:25,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-27 06:29:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:29:25,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:25,971 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] [2019-12-27 06:29:25,971 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-27 06:29:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:25,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739901894] [2019-12-27 06:29:25,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:26,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739901894] [2019-12-27 06:29:26,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:26,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:26,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581746475] [2019-12-27 06:29:26,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:26,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,051 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-27 06:29:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:26,098 INFO L93 Difference]: Finished difference Result 333 states and 611 transitions. [2019-12-27 06:29:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:26,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:29:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:26,100 INFO L225 Difference]: With dead ends: 333 [2019-12-27 06:29:26,100 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 06:29:26,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 06:29:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-12-27 06:29:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:29:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 607 transitions. [2019-12-27 06:29:26,109 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 607 transitions. Word has length 52 [2019-12-27 06:29:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:26,111 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 607 transitions. [2019-12-27 06:29:26,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 607 transitions. [2019-12-27 06:29:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:29:26,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:26,114 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] [2019-12-27 06:29:26,114 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-27 06:29:26,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:26,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939711983] [2019-12-27 06:29:26,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:26,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939711983] [2019-12-27 06:29:26,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:26,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:26,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871361129] [2019-12-27 06:29:26,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:26,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,206 INFO L87 Difference]: Start difference. First operand 329 states and 607 transitions. Second operand 3 states. [2019-12-27 06:29:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:26,219 INFO L93 Difference]: Finished difference Result 329 states and 594 transitions. [2019-12-27 06:29:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:26,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:29:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:26,221 INFO L225 Difference]: With dead ends: 329 [2019-12-27 06:29:26,221 INFO L226 Difference]: Without dead ends: 329 [2019-12-27 06:29:26,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-27 06:29:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-12-27 06:29:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:29:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 594 transitions. [2019-12-27 06:29:26,228 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 594 transitions. Word has length 52 [2019-12-27 06:29:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:26,229 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 594 transitions. [2019-12-27 06:29:26,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 594 transitions. [2019-12-27 06:29:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:29:26,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:26,230 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] [2019-12-27 06:29:26,230 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-27 06:29:26,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:26,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358679510] [2019-12-27 06:29:26,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:26,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358679510] [2019-12-27 06:29:26,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:26,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:26,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132683842] [2019-12-27 06:29:26,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:26,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,332 INFO L87 Difference]: Start difference. First operand 329 states and 594 transitions. Second operand 3 states. [2019-12-27 06:29:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:26,389 INFO L93 Difference]: Finished difference Result 328 states and 592 transitions. [2019-12-27 06:29:26,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:26,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:29:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:26,391 INFO L225 Difference]: With dead ends: 328 [2019-12-27 06:29:26,391 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 06:29:26,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 06:29:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 274. [2019-12-27 06:29:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 06:29:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 498 transitions. [2019-12-27 06:29:26,403 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 498 transitions. Word has length 53 [2019-12-27 06:29:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:26,403 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 498 transitions. [2019-12-27 06:29:26,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 498 transitions. [2019-12-27 06:29:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:29:26,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:26,406 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] [2019-12-27 06:29:26,406 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-27 06:29:26,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:26,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321553326] [2019-12-27 06:29:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321553326] [2019-12-27 06:29:26,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:26,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:29:26,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382811935] [2019-12-27 06:29:26,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:29:26,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:29:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:26,706 INFO L87 Difference]: Start difference. First operand 274 states and 498 transitions. Second operand 7 states. [2019-12-27 06:29:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:26,822 INFO L93 Difference]: Finished difference Result 489 states and 883 transitions. [2019-12-27 06:29:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:29:26,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:29:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:26,825 INFO L225 Difference]: With dead ends: 489 [2019-12-27 06:29:26,825 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 06:29:26,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:29:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 06:29:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 06:29:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 06:29:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 371 transitions. [2019-12-27 06:29:26,831 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 371 transitions. Word has length 54 [2019-12-27 06:29:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:26,831 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 371 transitions. [2019-12-27 06:29:26,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:29:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 371 transitions. [2019-12-27 06:29:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:29:26,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:26,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:26,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 2 times [2019-12-27 06:29:26,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:26,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070830910] [2019-12-27 06:29:26,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:26,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:29:26,949 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:29:26,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1103~0.base_20|) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1103~0.base_20|) 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1103~0.offset_15|) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1103~0.base_20| 1)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1103~0.base_20| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1103~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1103~0.base_20|) |v_ULTIMATE.start_main_~#t1103~0.offset_15| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_~#t1104~0.offset=|v_ULTIMATE.start_main_~#t1104~0.offset_14|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1103~0.base=|v_ULTIMATE.start_main_~#t1103~0.base_20|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t1104~0.base=|v_ULTIMATE.start_main_~#t1104~0.base_17|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_~#t1103~0.offset=|v_ULTIMATE.start_main_~#t1103~0.offset_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1104~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1103~0.base, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1104~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1103~0.offset, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:29:26,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1104~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1104~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1104~0.base_11|) |v_ULTIMATE.start_main_~#t1104~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1104~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1104~0.offset_10|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1104~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1104~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1104~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1104~0.offset=|v_ULTIMATE.start_main_~#t1104~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1104~0.base=|v_ULTIMATE.start_main_~#t1104~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1104~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1104~0.base] because there is no mapped edge [2019-12-27 06:29:26,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:29:26,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1920797317 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out1920797317| |P0Thread1of1ForFork0_#t~ite3_Out1920797317|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1920797317 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1920797317 |P0Thread1of1ForFork0_#t~ite3_Out1920797317|) .cse2) (and (= ~x$w_buff1~0_In1920797317 |P0Thread1of1ForFork0_#t~ite3_Out1920797317|) (not .cse1) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1920797317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920797317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1920797317, ~x~0=~x~0_In1920797317} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1920797317|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1920797317|, ~x$w_buff1~0=~x$w_buff1~0_In1920797317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920797317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1920797317, ~x~0=~x~0_In1920797317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:29:26,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1449830926 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1449830926 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1449830926| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1449830926| ~x$w_buff0_used~0_In-1449830926)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1449830926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449830926} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1449830926|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1449830926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1449830926} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:29:26,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In629246663 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In629246663 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In629246663 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In629246663 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In629246663 |P0Thread1of1ForFork0_#t~ite6_Out629246663|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out629246663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629246663, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629246663, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629246663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629246663} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out629246663|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629246663, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629246663, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629246663, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629246663} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:29:26,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In437063014 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In437063014 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out437063014|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In437063014 |P0Thread1of1ForFork0_#t~ite7_Out437063014|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In437063014, ~x$w_buff0_used~0=~x$w_buff0_used~0_In437063014} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In437063014, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out437063014|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In437063014} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:29:26,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1687244802 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1687244802 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1687244802 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1687244802 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1687244802 |P0Thread1of1ForFork0_#t~ite8_Out1687244802|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1687244802|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1687244802, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1687244802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1687244802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687244802} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1687244802, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1687244802|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1687244802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1687244802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1687244802} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:29:26,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:29:26,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1650454524 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1650454524 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1650454524| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1650454524| ~x$w_buff0_used~0_In-1650454524) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650454524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650454524} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1650454524|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1650454524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650454524} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:29:26,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1890094050 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1890094050 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1890094050 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1890094050 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1890094050| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1890094050| ~x$w_buff1_used~0_In-1890094050) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1890094050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1890094050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1890094050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1890094050} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1890094050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1890094050, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1890094050|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1890094050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1890094050} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:29:26,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1360757227 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1360757227 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1360757227) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1360757227 ~x$r_buff0_thd2~0_Out-1360757227)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1360757227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360757227} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1360757227|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1360757227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360757227} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:29:26,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1623251334 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1623251334 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1623251334 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1623251334 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1623251334 |P1Thread1of1ForFork1_#t~ite14_Out-1623251334|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1623251334| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623251334, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1623251334, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1623251334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623251334} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623251334, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1623251334, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1623251334, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1623251334|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623251334} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:29:26,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:29:26,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:29:26,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1723535995 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1723535995 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1723535995| ~x$w_buff1~0_In-1723535995)) (and (= ~x~0_In-1723535995 |ULTIMATE.start_main_#t~ite17_Out-1723535995|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1723535995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723535995, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1723535995, ~x~0=~x~0_In-1723535995} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1723535995|, ~x$w_buff1~0=~x$w_buff1~0_In-1723535995, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1723535995, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1723535995, ~x~0=~x~0_In-1723535995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 06:29:26,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 06:29:26,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1813026467 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1813026467 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1813026467 |ULTIMATE.start_main_#t~ite19_Out1813026467|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1813026467| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1813026467, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1813026467} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1813026467, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1813026467|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1813026467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:29:26,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1245967496 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1245967496 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1245967496 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1245967496 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1245967496| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out1245967496| ~x$w_buff1_used~0_In1245967496) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1245967496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1245967496, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1245967496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1245967496} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1245967496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1245967496, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1245967496|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1245967496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1245967496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:29:26,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1347570094 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1347570094 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1347570094|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1347570094| ~x$r_buff0_thd0~0_In1347570094)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1347570094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1347570094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1347570094, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1347570094|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1347570094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:29:26,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1520829895 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1520829895 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1520829895 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1520829895 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1520829895|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1520829895 |ULTIMATE.start_main_#t~ite22_Out1520829895|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1520829895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1520829895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1520829895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1520829895} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1520829895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1520829895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1520829895, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1520829895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1520829895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:29:26,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2012481343 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite32_Out-2012481343| |ULTIMATE.start_main_#t~ite31_Out-2012481343|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2012481343 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-2012481343 256) 0)) (= (mod ~x$w_buff0_used~0_In-2012481343 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2012481343 256))))) (= |ULTIMATE.start_main_#t~ite31_Out-2012481343| ~x$w_buff1~0_In-2012481343)) (and (= |ULTIMATE.start_main_#t~ite31_In-2012481343| |ULTIMATE.start_main_#t~ite31_Out-2012481343|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-2012481343| ~x$w_buff1~0_In-2012481343)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2012481343, ~x$w_buff1~0=~x$w_buff1~0_In-2012481343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2012481343, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2012481343, ~weak$$choice2~0=~weak$$choice2~0_In-2012481343, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2012481343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2012481343} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2012481343, ~x$w_buff1~0=~x$w_buff1~0_In-2012481343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2012481343, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2012481343|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2012481343, ~weak$$choice2~0=~weak$$choice2~0_In-2012481343, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2012481343|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2012481343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:29:26,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In275705365 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_In275705365| |ULTIMATE.start_main_#t~ite37_Out275705365|) (= ~x$w_buff1_used~0_In275705365 |ULTIMATE.start_main_#t~ite38_Out275705365|) (not .cse0)) (and .cse0 (= ~x$w_buff1_used~0_In275705365 |ULTIMATE.start_main_#t~ite37_Out275705365|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In275705365 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In275705365 256) 0)) (and (= (mod ~x$r_buff1_thd0~0_In275705365 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In275705365 256)))) (= |ULTIMATE.start_main_#t~ite38_Out275705365| |ULTIMATE.start_main_#t~ite37_Out275705365|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In275705365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In275705365, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In275705365|, ~weak$$choice2~0=~weak$$choice2~0_In275705365, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In275705365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In275705365} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In275705365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In275705365, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out275705365|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out275705365|, ~weak$$choice2~0=~weak$$choice2~0_In275705365, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In275705365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In275705365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:29:26,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:29:26,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:29:26,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:29:27,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:29:27 BasicIcfg [2019-12-27 06:29:27,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:29:27,040 INFO L168 Benchmark]: Toolchain (without parser) took 10330.22 ms. Allocated memory was 138.9 MB in the beginning and 505.4 MB in the end (delta: 366.5 MB). Free memory was 101.7 MB in the beginning and 297.4 MB in the end (delta: -195.7 MB). Peak memory consumption was 170.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,041 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.23 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 158.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,043 INFO L168 Benchmark]: Boogie Preprocessor took 46.78 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,044 INFO L168 Benchmark]: RCFGBuilder took 801.36 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 108.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,045 INFO L168 Benchmark]: TraceAbstraction took 8686.75 ms. Allocated memory was 204.5 MB in the beginning and 505.4 MB in the end (delta: 300.9 MB). Free memory was 108.2 MB in the beginning and 297.4 MB in the end (delta: -189.1 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:27,049 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.23 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.5 MB in the beginning and 158.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.78 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.36 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 108.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8686.75 ms. Allocated memory was 204.5 MB in the beginning and 505.4 MB in the end (delta: 300.9 MB). Free memory was 108.2 MB in the beginning and 297.4 MB in the end (delta: -189.1 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 780 SDtfs, 721 SDslu, 937 SDs, 0 SdLazy, 328 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12754occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 31059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...